/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:54:41,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:54:41,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:54:41,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:54:41,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:54:41,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:54:41,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:54:41,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:54:41,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:54:41,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:54:41,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:54:41,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:54:41,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:54:41,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:54:41,119 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:54:41,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:54:41,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:54:41,119 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:54:41,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:54:41,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:54:41,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:54:41,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:54:41,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:54:41,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:54:41,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:54:41,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:54:41,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:54:41,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:54:41,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:54:41,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:54:41,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:41,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:54:41,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:54:41,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:54:41,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:54:41,125 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:54:41,126 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 -> INSUFFICIENT_FIRST [2023-08-04 02:54:41,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:54:41,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:54:41,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:54:41,396 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:54:41,397 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:54:41,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-04 02:54:42,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:54:42,642 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:54:42,642 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-04 02:54:42,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c6daadd/9f927955ef994c2eb5ab2f984b27e01e/FLAG9a4b8c8a5 [2023-08-04 02:54:42,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c6daadd/9f927955ef994c2eb5ab2f984b27e01e [2023-08-04 02:54:42,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:54:42,664 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:54:42,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:42,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:54:42,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:54:42,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504b5343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42, skipping insertion in model container [2023-08-04 02:54:42,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,689 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:54:42,820 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-figure3.wvr_bound2.c[2283,2296] [2023-08-04 02:54:42,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:42,829 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:54:42,847 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-figure3.wvr_bound2.c[2283,2296] [2023-08-04 02:54:42,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:42,855 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:42,855 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:42,861 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:54:42,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42 WrapperNode [2023-08-04 02:54:42,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:42,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:42,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:54:42,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:54:42,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,893 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-08-04 02:54:42,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:42,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:54:42,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:54:42,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:54:42,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:54:42,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:54:42,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:54:42,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:54:42,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (1/1) ... [2023-08-04 02:54:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:42,949 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 02:54:42,951 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 02:54:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:54:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:54:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:54:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:54:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:54:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:54:42,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:54:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:54:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:54:42,977 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 02:54:43,060 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:54:43,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:54:43,268 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:54:43,287 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:54:43,287 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 02:54:43,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:43 BoogieIcfgContainer [2023-08-04 02:54:43,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:54:43,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:54:43,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:54:43,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:54:43,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:54:42" (1/3) ... [2023-08-04 02:54:43,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1430975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:43, skipping insertion in model container [2023-08-04 02:54:43,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:42" (2/3) ... [2023-08-04 02:54:43,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1430975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:43, skipping insertion in model container [2023-08-04 02:54:43,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:43" (3/3) ... [2023-08-04 02:54:43,314 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-figure3.wvr_bound2.c [2023-08-04 02:54:43,320 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:54:43,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:54:43,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:54:43,326 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:54:43,381 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:54:43,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,495 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 02:54:43,496 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:43,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 02:54:43,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,513 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:43,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,523 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 02:54:43,568 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 02:54:43,569 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:43,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 02:54:43,582 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 02:54:45,744 INFO L134 LiptonReduction]: Checked pairs total: 2943 [2023-08-04 02:54:45,745 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 02:54:45,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:45,761 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;@7e4be2fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:45,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:45,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:45,767 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 02:54:45,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:45,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:45,768 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 02:54:45,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:45,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 325807919, now seen corresponding path program 1 times [2023-08-04 02:54:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593801062] [2023-08-04 02:54:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:45,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:54:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:45,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:54:45,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:54:45,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:45,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:45,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:54:45,940 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 02:54:45,942 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:54:45,943 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:54:45,943 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:54:45,965 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:54:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,068 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 02:54:46,068 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:46,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 02:54:46,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,083 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:46,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:46,170 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 02:54:46,170 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:46,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 02:54:46,188 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:48,382 INFO L134 LiptonReduction]: Checked pairs total: 8679 [2023-08-04 02:54:48,382 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-04 02:54:48,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:48,385 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;@7e4be2fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:48,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:48,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:48,392 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2023-08-04 02:54:48,392 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:54:48,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:48,392 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 02:54:48,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:48,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1130901059, now seen corresponding path program 1 times [2023-08-04 02:54:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235065476] [2023-08-04 02:54:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:48,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:48,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235065476] [2023-08-04 02:54:48,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235065476] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732471198] [2023-08-04 02:54:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:48,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:48,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:48,617 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 02:54:48,643 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 02:54:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:48,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:48,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:48,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732471198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 02:54:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544089859] [2023-08-04 02:54:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:48,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:48,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-04 02:54:48,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 02:54:48,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:48,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-04 02:54:48,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:49,648 INFO L124 PetriNetUnfolderBase]: 8553/11151 cut-off events. [2023-08-04 02:54:49,648 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-04 02:54:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22551 conditions, 11151 events. 8553/11151 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 50137 event pairs, 2448 based on Foata normal form. 0/6346 useless extension candidates. Maximal degree in co-relation 6846. Up to 10615 conditions per place. [2023-08-04 02:54:49,684 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 23 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-08-04 02:54:49,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-04 02:54:49,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717741935483871 [2023-08-04 02:54:49,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-04 02:54:49,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-04 02:54:49,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:49,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-04 02:54:49,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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 02:54:49,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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 02:54:49,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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 02:54:49,715 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 5 states and 585 transitions. [2023-08-04 02:54:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:49,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:49,721 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:49,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 02:54:49,726 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 02:54:49,726 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 02:54:49,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:49,727 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:54:49,739 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 02:54:49,932 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 02:54:49,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:49,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1132308398, now seen corresponding path program 1 times [2023-08-04 02:54:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236121657] [2023-08-04 02:54:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:49,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236121657] [2023-08-04 02:54:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236121657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127636103] [2023-08-04 02:54:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:49,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2023-08-04 02:54:49,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 02:54:49,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:49,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2023-08-04 02:54:49,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:50,148 INFO L124 PetriNetUnfolderBase]: 1760/2333 cut-off events. [2023-08-04 02:54:50,148 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-04 02:54:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2333 events. 1760/2333 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8365 event pairs, 685 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 1396. Up to 2189 conditions per place. [2023-08-04 02:54:50,163 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 21 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 02:54:50,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-04 02:54:50,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47043010752688175 [2023-08-04 02:54:50,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-04 02:54:50,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-04 02:54:50,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:50,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-04 02:54:50,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 02:54:50,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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 02:54:50,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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 02:54:50,169 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 91 flow. Second operand 3 states and 350 transitions. [2023-08-04 02:54:50,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:50,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:50,171 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:50,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-04 02:54:50,172 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:50,172 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:50,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 02:54:50,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:50,172 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:50,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:54:50,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:50,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -797679345, now seen corresponding path program 1 times [2023-08-04 02:54:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470041678] [2023-08-04 02:54:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,235 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 02:54:50,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:50,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470041678] [2023-08-04 02:54:50,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470041678] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:50,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17215719] [2023-08-04 02:54:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:50,246 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 02:54:50,249 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 02:54:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:50,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:50,336 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 02:54:50,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:50,367 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 02:54:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17215719] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:50,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725817391] [2023-08-04 02:54:50,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:50,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:50,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:50,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-04 02:54:50,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:50,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-04 02:54:50,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:50,566 INFO L124 PetriNetUnfolderBase]: 1432/1870 cut-off events. [2023-08-04 02:54:50,566 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-08-04 02:54:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1870 events. 1432/1870 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6152 event pairs, 357 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2803. Up to 1729 conditions per place. [2023-08-04 02:54:50,577 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-04 02:54:50,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-04 02:54:50,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627016129032258 [2023-08-04 02:54:50,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-04 02:54:50,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-04 02:54:50,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:50,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-04 02:54:50,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 02:54:50,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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 02:54:50,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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 02:54:50,584 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 87 flow. Second operand 4 states and 459 transitions. [2023-08-04 02:54:50,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:50,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:50,587 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:50,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-04 02:54:50,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-04 02:54:50,590 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:50,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:50,593 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:50,601 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 02:54:50,801 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,SelfDestructingSolverStorable3 [2023-08-04 02:54:50,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:50,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 144395151, now seen corresponding path program 1 times [2023-08-04 02:54:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:50,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900195380] [2023-08-04 02:54:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900195380] [2023-08-04 02:54:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900195380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097053105] [2023-08-04 02:54:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:50,914 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 02:54:50,917 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 02:54:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:50,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:51,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097053105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:51,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:51,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:54:51,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233076911] [2023-08-04 02:54:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:51,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:51,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-04 02:54:51,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:51,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-04 02:54:51,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:51,151 INFO L124 PetriNetUnfolderBase]: 1000/1330 cut-off events. [2023-08-04 02:54:51,152 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-08-04 02:54:51,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1330 events. 1000/1330 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4423 event pairs, 43 based on Foata normal form. 81/871 useless extension candidates. Maximal degree in co-relation 1017. Up to 558 conditions per place. [2023-08-04 02:54:51,155 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 02:54:51,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-08-04 02:54:51,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669354838709677 [2023-08-04 02:54:51,158 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-08-04 02:54:51,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-08-04 02:54:51,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:51,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-08-04 02:54:51,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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 02:54:51,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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 02:54:51,163 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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 02:54:51,163 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 5 states and 579 transitions. [2023-08-04 02:54:51,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:51,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 02:54:51,165 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:51,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-04 02:54:51,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:51,166 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:51,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:51,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:51,171 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 02:54:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:51,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:54:51,372 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:54:51,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,441 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 02:54:51,442 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:51,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 02:54:51,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,450 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:51,450 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 02:54:51,507 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 02:54:51,507 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:51,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 02:54:51,525 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:53,708 INFO L134 LiptonReduction]: Checked pairs total: 8751 [2023-08-04 02:54:53,709 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 02:54:53,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:54:53,711 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;@7e4be2fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:53,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:54:53,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:53,713 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 02:54:53,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:53,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:53,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 02:54:53,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:53,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 791459354, now seen corresponding path program 1 times [2023-08-04 02:54:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:53,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977403019] [2023-08-04 02:54:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:53,732 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 02:54:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977403019] [2023-08-04 02:54:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977403019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755877335] [2023-08-04 02:54:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:53,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:53,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-08-04 02:54:53,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 02:54:53,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:53,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-08-04 02:54:53,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:54,360 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 02:54:54,361 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-04 02:54:54,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 47476 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-04 02:54:54,440 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 02:54:54,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 02:54:54,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488 [2023-08-04 02:54:54,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 02:54:54,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 02:54:54,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:54,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 02:54:54,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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 02:54:54,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:54,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:54,450 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 366 transitions. [2023-08-04 02:54:54,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:54,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:54:54,455 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:54,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-04 02:54:54,457 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:54,457 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 02:54:54,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:54,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:54,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 02:54:54,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:54,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1687514080, now seen corresponding path program 1 times [2023-08-04 02:54:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:54,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746977923] [2023-08-04 02:54:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:54,512 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 02:54:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746977923] [2023-08-04 02:54:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746977923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110810053] [2023-08-04 02:54:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:54,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:54,518 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 02:54:54,543 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 02:54:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:54,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:54,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:54,580 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 02:54:54,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110810053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:54,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:54,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214030584] [2023-08-04 02:54:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:54,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-08-04 02:54:54,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 02:54:54,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:54,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-08-04 02:54:54,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:55,218 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 02:54:55,218 INFO L125 PetriNetUnfolderBase]: For 859/859 co-relation queries the response was YES. [2023-08-04 02:54:55,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 49321 event pairs, 3438 based on Foata normal form. 0/6262 useless extension candidates. Maximal degree in co-relation 22230. Up to 10389 conditions per place. [2023-08-04 02:54:55,280 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 02:54:55,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 02:54:55,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492 [2023-08-04 02:54:55,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 02:54:55,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 02:54:55,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:55,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 02:54:55,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 02:54:55,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:55,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:55,285 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 369 transitions. [2023-08-04 02:54:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:55,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:55,290 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:55,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-04 02:54:55,291 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 02:54:55,291 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:55,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 02:54:55,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:55,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:55,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:55,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:55,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:55,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1478473804, now seen corresponding path program 1 times [2023-08-04 02:54:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035834085] [2023-08-04 02:54:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:55,536 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 02:54:55,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035834085] [2023-08-04 02:54:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035834085] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839018995] [2023-08-04 02:54:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:55,539 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 02:54:55,575 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 02:54:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:55,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:55,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:55,623 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 02:54:55,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839018995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682780413] [2023-08-04 02:54:55,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:55,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:55,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-08-04 02:54:55,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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 02:54:55,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:55,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-08-04 02:54:55,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:56,124 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 02:54:56,124 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-04 02:54:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 43117 event pairs, 2490 based on Foata normal form. 0/5673 useless extension candidates. Maximal degree in co-relation 6727. Up to 6828 conditions per place. [2023-08-04 02:54:56,175 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 02:54:56,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 02:54:56,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 02:54:56,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 02:54:56,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 02:54:56,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:56,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 02:54:56,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 02:54:56,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:56,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:56,180 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 375 transitions. [2023-08-04 02:54:56,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:56,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:56,183 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:56,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 02:54:56,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:56,183 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:56,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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 02:54:56,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:56,184 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 02:54:56,195 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 02:54:56,389 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 02:54:56,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:56,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1243948912, now seen corresponding path program 1 times [2023-08-04 02:54:56,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760303377] [2023-08-04 02:54:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:56,447 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 02:54:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:56,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760303377] [2023-08-04 02:54:56,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760303377] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:56,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654267629] [2023-08-04 02:54:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:56,452 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 02:54:56,454 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 02:54:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:56,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:56,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:56,514 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 02:54:56,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654267629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 02:54:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421604540] [2023-08-04 02:54:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:56,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:56,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:56,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-08-04 02:54:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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 02:54:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-08-04 02:54:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:57,016 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 02:54:57,016 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2023-08-04 02:54:57,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42988 event pairs, 2789 based on Foata normal form. 0/5933 useless extension candidates. Maximal degree in co-relation 7255. Up to 7262 conditions per place. [2023-08-04 02:54:57,057 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 02:54:57,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 02:54:57,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 02:54:57,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 02:54:57,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 02:54:57,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:57,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 02:54:57,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 02:54:57,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:57,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:54:57,062 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 375 transitions. [2023-08-04 02:54:57,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:57,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:57,068 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:57,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 02:54:57,068 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 02:54:57,068 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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 02:54:57,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:57,069 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 02:54:57,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 02:54:57,274 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 02:54:57,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:57,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash -63956518, now seen corresponding path program 1 times [2023-08-04 02:54:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445722817] [2023-08-04 02:54:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:57,313 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 02:54:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445722817] [2023-08-04 02:54:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445722817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394935930] [2023-08-04 02:54:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:57,318 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 02:54:57,320 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 02:54:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:57,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:57,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:57,396 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 02:54:57,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:57,417 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 02:54:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394935930] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:57,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500227782] [2023-08-04 02:54:57,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:57,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:54:57,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:57,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:54:57,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:57,846 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 02:54:57,846 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-04 02:54:57,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38289 event pairs, 1919 based on Foata normal form. 3/5405 useless extension candidates. Maximal degree in co-relation 12362. Up to 8125 conditions per place. [2023-08-04 02:54:57,897 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 02:54:57,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 02:54:57,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-04 02:54:57,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 02:54:57,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 02:54:57,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:57,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 02:54:57,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 02:54:57,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:57,902 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:57,902 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 475 transitions. [2023-08-04 02:54:57,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:57,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:57,922 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 02:54:57,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 02:54:57,923 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:57,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:57,923 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:57,935 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 02:54:58,129 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 02:54:58,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:58,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1265937960, now seen corresponding path program 1 times [2023-08-04 02:54:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497759177] [2023-08-04 02:54:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:58,189 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 02:54:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497759177] [2023-08-04 02:54:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497759177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54380405] [2023-08-04 02:54:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:58,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:58,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:58,192 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 02:54:58,219 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 02:54:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:58,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:58,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:58,279 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 02:54:58,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:58,290 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 02:54:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54380405] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:58,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:58,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449338063] [2023-08-04 02:54:58,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:58,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:58,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:54:58,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 02:54:58,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:58,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:54:58,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:58,710 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 02:54:58,711 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2023-08-04 02:54:58,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36540 event pairs, 1699 based on Foata normal form. 27/5129 useless extension candidates. Maximal degree in co-relation 11398. Up to 6552 conditions per place. [2023-08-04 02:54:58,746 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 02:54:58,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 02:54:58,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483 [2023-08-04 02:54:58,748 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 02:54:58,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 02:54:58,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:58,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 02:54:58,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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 02:54:58,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:58,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:58,752 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 483 transitions. [2023-08-04 02:54:58,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:58,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:58,764 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:58,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-04 02:54:58,765 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 02:54:58,765 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 02:54:58,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:58,765 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:58,777 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 02:54:58,977 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 02:54:58,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:58,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1474825355, now seen corresponding path program 1 times [2023-08-04 02:54:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924446835] [2023-08-04 02:54:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:59,025 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 02:54:59,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924446835] [2023-08-04 02:54:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924446835] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855700250] [2023-08-04 02:54:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:59,027 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 02:54:59,030 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 02:54:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:59,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:59,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:59,112 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 02:54:59,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:59,129 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 02:54:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855700250] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:59,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841201476] [2023-08-04 02:54:59,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:59,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:54:59,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:59,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:59,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:54:59,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:59,490 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 02:54:59,491 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 02:54:59,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22958 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10556. Up to 2080 conditions per place. [2023-08-04 02:54:59,513 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 02:54:59,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 02:54:59,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489 [2023-08-04 02:54:59,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 02:54:59,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 02:54:59,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:59,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 02:54:59,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 02:54:59,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:59,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:54:59,519 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 489 transitions. [2023-08-04 02:54:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:59,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:54:59,526 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:59,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-04 02:54:59,527 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 02:54:59,527 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:59,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:59,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:59,527 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:59,533 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 02:54:59,733 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 02:54:59,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:59,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1648498196, now seen corresponding path program 1 times [2023-08-04 02:54:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672325054] [2023-08-04 02:54:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:59,795 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 02:54:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672325054] [2023-08-04 02:54:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672325054] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905930224] [2023-08-04 02:54:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:59,797 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 02:54:59,820 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 02:54:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:59,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:59,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:59,883 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 02:54:59,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:59,895 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 02:54:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905930224] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:59,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798346729] [2023-08-04 02:54:59,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:59,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:54:59,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 02:54:59,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:59,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:54:59,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:00,244 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 02:55:00,244 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-04 02:55:00,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22674 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11102. Up to 4661 conditions per place. [2023-08-04 02:55:00,264 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 02:55:00,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 02:55:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 02:55:00,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489 [2023-08-04 02:55:00,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 02:55:00,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 02:55:00,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:00,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 02:55:00,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 02:55:00,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:00,269 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:00,269 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 489 transitions. [2023-08-04 02:55:00,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 02:55:00,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:00,279 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 02:55:00,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-04 02:55:00,279 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 02:55:00,279 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 02:55:00,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 02:55:00,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:00,280 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:00,287 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 02:55:00,486 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 02:55:00,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:00,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1515729954, now seen corresponding path program 1 times [2023-08-04 02:55:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827238954] [2023-08-04 02:55:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:00,709 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 02:55:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827238954] [2023-08-04 02:55:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827238954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 02:55:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210028706] [2023-08-04 02:55:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:00,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:55:00,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:55:00,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:55:00,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2023-08-04 02:55:00,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 02:55:00,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:00,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2023-08-04 02:55:00,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:01,064 INFO L124 PetriNetUnfolderBase]: 4362/5806 cut-off events. [2023-08-04 02:55:01,064 INFO L125 PetriNetUnfolderBase]: For 3151/3151 co-relation queries the response was YES. [2023-08-04 02:55:01,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13540 conditions, 5806 events. 4362/5806 cut-off events. For 3151/3151 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 24232 event pairs, 733 based on Foata normal form. 1/3745 useless extension candidates. Maximal degree in co-relation 13262. Up to 4855 conditions per place. [2023-08-04 02:55:01,087 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 65 selfloop transitions, 3 changer transitions 1/77 dead transitions. [2023-08-04 02:55:01,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 482 flow [2023-08-04 02:55:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:55:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:55:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-04 02:55:01,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253333333333333 [2023-08-04 02:55:01,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-04 02:55:01,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-04 02:55:01,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:01,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-04 02:55:01,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 02:55:01,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:55:01,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 02:55:01,092 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 3 states and 394 transitions. [2023-08-04 02:55:01,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 482 flow [2023-08-04 02:55:01,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 466 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 02:55:01,101 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 205 flow [2023-08-04 02:55:01,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-04 02:55:01,102 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 02:55:01,102 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 205 flow [2023-08-04 02:55:01,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 02:55:01,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:01,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 02:55:01,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:01,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 740724371, now seen corresponding path program 1 times [2023-08-04 02:55:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769913722] [2023-08-04 02:55:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:55:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769913722] [2023-08-04 02:55:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769913722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197573895] [2023-08-04 02:55:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:01,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:01,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-08-04 02:55:01,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:01,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-08-04 02:55:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:02,006 INFO L124 PetriNetUnfolderBase]: 6015/8743 cut-off events. [2023-08-04 02:55:02,006 INFO L125 PetriNetUnfolderBase]: For 5964/5964 co-relation queries the response was YES. [2023-08-04 02:55:02,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22805 conditions, 8743 events. 6015/8743 cut-off events. For 5964/5964 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 47553 event pairs, 1809 based on Foata normal form. 619/9362 useless extension candidates. Maximal degree in co-relation 22310. Up to 4587 conditions per place. [2023-08-04 02:55:02,039 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 97 selfloop transitions, 4 changer transitions 30/137 dead transitions. [2023-08-04 02:55:02,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 137 transitions, 892 flow [2023-08-04 02:55:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-04 02:55:02,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024 [2023-08-04 02:55:02,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-04 02:55:02,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-04 02:55:02,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:02,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-04 02:55:02,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 02:55:02,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:02,046 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:02,046 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 205 flow. Second operand 5 states and 628 transitions. [2023-08-04 02:55:02,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 137 transitions, 892 flow [2023-08-04 02:55:02,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 137 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:02,075 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 237 flow [2023-08-04 02:55:02,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-04 02:55:02,076 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-04 02:55:02,076 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 237 flow [2023-08-04 02:55:02,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:02,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:02,077 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:02,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 02:55:02,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:02,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1960294791, now seen corresponding path program 1 times [2023-08-04 02:55:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434324913] [2023-08-04 02:55:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434324913] [2023-08-04 02:55:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434324913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:55:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70472605] [2023-08-04 02:55:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:02,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:55:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:55:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:55:02,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-04 02:55:02,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 02:55:02,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:02,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-04 02:55:02,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:02,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 420#true, 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 1037#true, thread1Thread1of2ForFork1InUse, 7#L71-6true, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,327 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-04 02:55:02,327 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 02:55:02,327 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 02:55:02,327 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 02:55:02,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 420#true, 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 1037#true, 61#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 7#L71-6true, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,349 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 02:55:02,349 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 02:55:02,349 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 02:55:02,349 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 02:55:02,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 51#L71-11true, 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,405 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 02:55:02,405 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 02:55:02,405 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 02:55:02,405 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 02:55:02,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 51#L71-11true, 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,428 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,428 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,428 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 02:55:02,428 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,438 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,438 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,438 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 02:55:02,438 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,459 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,459 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,459 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,459 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 41#L72-3true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,466 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,467 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,467 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 02:55:02,467 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 41#L72-3true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, 61#thread1EXITtrue, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,485 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,485 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,485 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,485 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 112#L72-4true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,486 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,486 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,486 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,486 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 112#L72-4true, 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,514 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 112#L72-4true, 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,514 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,514 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,515 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:02,515 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 112#L72-4true, 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 13#thread2EXITtrue, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,541 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,541 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,541 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,541 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,541 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,542 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,542 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,542 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:02,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,569 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,569 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,569 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,569 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 70#L41-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,570 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,570 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,570 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,570 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 41#L72-3true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,571 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,571 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,571 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,571 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:02,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 13#thread2EXITtrue, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,610 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,610 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 41#L72-3true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,611 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,611 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,611 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,611 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 79#L51-4true, 70#L41-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1037#true, thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,612 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,612 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:02,612 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,612 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 41#L72-3true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 13#thread2EXITtrue, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:02,646 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:02,646 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:02,646 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:02,646 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:02,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 112#L72-4true, 1037#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:02,669 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:55:02,669 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:02,669 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:02,669 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:02,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:02,717 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 02:55:02,717 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:02,717 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:02,717 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:55:02,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1034#(= ~counter~0 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 10#L73-8true, 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:02,748 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 02:55:02,748 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:02,748 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:02,748 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:02,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 117#L73-3true, Black: 1034#(= ~counter~0 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1037#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1046#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:02,770 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 02:55:02,770 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:02,770 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:02,770 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:02,797 INFO L124 PetriNetUnfolderBase]: 5971/8431 cut-off events. [2023-08-04 02:55:02,798 INFO L125 PetriNetUnfolderBase]: For 10614/11529 co-relation queries the response was YES. [2023-08-04 02:55:02,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26482 conditions, 8431 events. 5971/8431 cut-off events. For 10614/11529 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 43145 event pairs, 1227 based on Foata normal form. 972/9180 useless extension candidates. Maximal degree in co-relation 26024. Up to 5362 conditions per place. [2023-08-04 02:55:02,836 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 90 selfloop transitions, 4 changer transitions 5/106 dead transitions. [2023-08-04 02:55:02,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 713 flow [2023-08-04 02:55:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-04 02:55:02,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502 [2023-08-04 02:55:02,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-04 02:55:02,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-04 02:55:02,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:02,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-04 02:55:02,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states 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 02:55:02,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:02,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:02,841 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 237 flow. Second operand 4 states and 502 transitions. [2023-08-04 02:55:02,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 713 flow [2023-08-04 02:55:02,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 701 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:02,857 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 256 flow [2023-08-04 02:55:02,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-04 02:55:02,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-04 02:55:02,858 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 256 flow [2023-08-04 02:55:02,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 02:55:02,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:02,858 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:02,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 02:55:02,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:02,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1035441978, now seen corresponding path program 1 times [2023-08-04 02:55:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695323345] [2023-08-04 02:55:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:02,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695323345] [2023-08-04 02:55:02,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695323345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:02,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59552873] [2023-08-04 02:55:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:02,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:03,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-08-04 02:55:03,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 02:55:03,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:03,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-08-04 02:55:03,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:03,811 INFO L124 PetriNetUnfolderBase]: 6802/10227 cut-off events. [2023-08-04 02:55:03,811 INFO L125 PetriNetUnfolderBase]: For 22466/23364 co-relation queries the response was YES. [2023-08-04 02:55:03,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32754 conditions, 10227 events. 6802/10227 cut-off events. For 22466/23364 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 58071 event pairs, 2185 based on Foata normal form. 1500/11671 useless extension candidates. Maximal degree in co-relation 32108. Up to 6135 conditions per place. [2023-08-04 02:55:03,854 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 95 selfloop transitions, 4 changer transitions 32/138 dead transitions. [2023-08-04 02:55:03,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 138 transitions, 969 flow [2023-08-04 02:55:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-04 02:55:03,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992 [2023-08-04 02:55:03,856 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-04 02:55:03,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-04 02:55:03,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:03,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-04 02:55:03,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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 02:55:03,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:03,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:03,860 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 256 flow. Second operand 5 states and 624 transitions. [2023-08-04 02:55:03,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 138 transitions, 969 flow [2023-08-04 02:55:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 138 transitions, 962 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:03,907 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 291 flow [2023-08-04 02:55:03,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-04 02:55:03,908 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-04 02:55:03,908 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 291 flow [2023-08-04 02:55:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 02:55:03,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:03,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:03,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 02:55:03,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:03,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:03,909 INFO L85 PathProgramCache]: Analyzing trace with hash -407020182, now seen corresponding path program 1 times [2023-08-04 02:55:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:03,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823797278] [2023-08-04 02:55:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823797278] [2023-08-04 02:55:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823797278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:55:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974396999] [2023-08-04 02:55:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:03,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:55:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:55:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:55:04,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-04 02:55:04,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 02:55:04,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:04,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-04 02:55:04,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:04,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 70#L41-4true, Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,483 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,483 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:04,483 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,483 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:04,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,492 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,492 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:04,492 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 02:55:04,492 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 41#L72-3true, Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,537 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,537 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,537 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,537 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 41#L72-3true, Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,553 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,553 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,553 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,553 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [24#thread1EXITtrue, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,561 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,561 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,561 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,561 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 70#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,564 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,564 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,564 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,564 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:55:04,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 41#L72-3true, 70#L41-4true, Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,608 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,608 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,608 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,608 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,609 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,609 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,609 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,609 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 112#L72-4true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:04,626 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,626 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,626 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,626 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [24#thread1EXITtrue, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,631 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,631 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,631 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,632 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,633 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,633 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,633 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,633 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:04,637 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,637 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,638 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,638 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:55:04,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 13#thread2EXITtrue, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,686 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,686 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,686 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,686 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 61#thread1EXITtrue, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, thread2Thread1of2ForFork0NotInUse, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:04,687 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,687 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,687 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,687 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,707 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,707 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,707 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [24#thread1EXITtrue, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 598#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:04,708 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,708 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,708 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,708 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:55:04,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,764 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,764 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,764 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,764 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:04,888 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,888 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,888 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,888 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:04,894 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:04,898 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,898 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:04,898 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:04,898 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:55:05,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 13#thread2EXITtrue, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,044 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,044 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,044 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,044 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 61#thread1EXITtrue, thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 596#true, thread2Thread1of2ForFork0NotInUse, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:05,045 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,045 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,045 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,045 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 70#L41-4true, 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,046 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,046 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,046 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,046 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,060 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,060 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,060 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,060 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,063 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,063 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,063 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,063 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [24#thread1EXITtrue, 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,063 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,064 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,064 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,064 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,066 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,066 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,066 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,066 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,069 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,069 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,069 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,069 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:55:05,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 41#L72-3true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 13#thread2EXITtrue, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,152 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,152 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,152 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,152 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 41#L72-3true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), 61#thread1EXITtrue, thread1Thread1of2ForFork1InUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse, Black: 596#true]) [2023-08-04 02:55:05,153 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,153 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,153 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,153 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse]) [2023-08-04 02:55:05,166 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [24#thread1EXITtrue, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 596#true, Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,167 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,167 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:55:05,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 112#L72-4true, 1074#true, 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), thread2Thread1of2ForFork0NotInUse, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:05,237 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 02:55:05,237 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:55:05,237 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,237 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, 112#L72-4true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, Black: 596#true, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,245 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 02:55:05,245 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,245 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:55:05,245 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:55:05,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0NotInUse, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:05,317 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,317 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,317 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:05,317 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:05,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0NotInUse, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:05,327 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,327 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:05,327 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:55:05,327 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), 10#L73-8true, Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0NotInUse, 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0))]) [2023-08-04 02:55:05,372 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,372 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,372 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,372 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1034#(= ~counter~0 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 10#L73-8true, Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,381 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,381 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:55:05,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 70#L41-4true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 117#L73-3true, Black: 1034#(= ~counter~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1061#(= thread1Thread2of2ForFork1_~i~0 0), thread1Thread1of2ForFork1NotInUse, Black: 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0NotInUse, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), 19#L51-4true]) [2023-08-04 02:55:05,409 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 02:55:05,409 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,409 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,409 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 02:55:05,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([784] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_47| 4294967296) (mod v_~N~0_133 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12| (ite (< 0 (mod v_~counter~0_167 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12| 0)) (= v_~counter~0_167 (+ v_~counter~0_166 v_~c~0_118)) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_47| 1) |v_thread2Thread2of2ForFork0_~i~1#1_46|)) InVars {~counter~0=v_~counter~0_167, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_47|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_133} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_24|, ~counter~0=v_~counter~0_166, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_46|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_12|, ~N~0=v_~N~0_133, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][63], [Black: 1055#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 799#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 796#true, 1054#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 117#L73-3true, Black: 1034#(= ~counter~0 0), 798#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1061#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1065#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 1039#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1067#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 1074#true, Black: 423#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread1Thread1of2ForFork1InUse, 1059#true, Black: 599#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 19#L51-4true, Black: 1043#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse]) [2023-08-04 02:55:05,416 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 02:55:05,416 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,416 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:55:05,416 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 02:55:05,512 INFO L124 PetriNetUnfolderBase]: 12718/18368 cut-off events. [2023-08-04 02:55:05,512 INFO L125 PetriNetUnfolderBase]: For 46775/49237 co-relation queries the response was YES. [2023-08-04 02:55:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68306 conditions, 18368 events. 12718/18368 cut-off events. For 46775/49237 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 111415 event pairs, 4464 based on Foata normal form. 2042/19671 useless extension candidates. Maximal degree in co-relation 67177. Up to 8797 conditions per place. [2023-08-04 02:55:05,590 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 96 selfloop transitions, 12 changer transitions 4/119 dead transitions. [2023-08-04 02:55:05,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 886 flow [2023-08-04 02:55:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-04 02:55:05,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501 [2023-08-04 02:55:05,592 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-04 02:55:05,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-04 02:55:05,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:05,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-04 02:55:05,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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 02:55:05,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:05,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:05,595 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 291 flow. Second operand 4 states and 501 transitions. [2023-08-04 02:55:05,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 886 flow [2023-08-04 02:55:05,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 866 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:05,666 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 413 flow [2023-08-04 02:55:05,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-08-04 02:55:05,667 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-04 02:55:05,667 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 413 flow [2023-08-04 02:55:05,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 02:55:05,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:05,667 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 02:55:05,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:05,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -295626365, now seen corresponding path program 1 times [2023-08-04 02:55:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262555615] [2023-08-04 02:55:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262555615] [2023-08-04 02:55:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262555615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252832148] [2023-08-04 02:55:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:05,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:05,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-08-04 02:55:05,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 413 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:05,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:05,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-08-04 02:55:05,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:08,257 INFO L124 PetriNetUnfolderBase]: 17064/26388 cut-off events. [2023-08-04 02:55:08,257 INFO L125 PetriNetUnfolderBase]: For 115606/118652 co-relation queries the response was YES. [2023-08-04 02:55:08,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101916 conditions, 26388 events. 17064/26388 cut-off events. For 115606/118652 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 183398 event pairs, 5846 based on Foata normal form. 4752/30682 useless extension candidates. Maximal degree in co-relation 99870. Up to 14593 conditions per place. [2023-08-04 02:55:08,401 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 134 selfloop transitions, 5 changer transitions 1/147 dead transitions. [2023-08-04 02:55:08,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 147 transitions, 1234 flow [2023-08-04 02:55:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-04 02:55:08,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896 [2023-08-04 02:55:08,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-04 02:55:08,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-04 02:55:08,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:08,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-04 02:55:08,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:55:08,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:08,407 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:08,407 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 413 flow. Second operand 5 states and 612 transitions. [2023-08-04 02:55:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 147 transitions, 1234 flow [2023-08-04 02:55:08,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 1226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:08,567 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 519 flow [2023-08-04 02:55:08,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2023-08-04 02:55:08,568 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-08-04 02:55:08,568 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 519 flow [2023-08-04 02:55:08,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:08,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:08,569 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:08,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 02:55:08,569 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:08,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -219504737, now seen corresponding path program 2 times [2023-08-04 02:55:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148218448] [2023-08-04 02:55:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148218448] [2023-08-04 02:55:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148218448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:08,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:55:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176627458] [2023-08-04 02:55:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:08,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:55:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:55:08,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:55:08,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-04 02:55:08,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 519 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 02:55:08,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:08,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-04 02:55:08,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:10,470 INFO L124 PetriNetUnfolderBase]: 13531/20931 cut-off events. [2023-08-04 02:55:10,470 INFO L125 PetriNetUnfolderBase]: For 116672/121552 co-relation queries the response was YES. [2023-08-04 02:55:10,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93259 conditions, 20931 events. 13531/20931 cut-off events. For 116672/121552 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 143513 event pairs, 6099 based on Foata normal form. 3150/23236 useless extension candidates. Maximal degree in co-relation 91793. Up to 11412 conditions per place. [2023-08-04 02:55:10,585 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 79 selfloop transitions, 5 changer transitions 27/119 dead transitions. [2023-08-04 02:55:10,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 119 transitions, 1051 flow [2023-08-04 02:55:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-04 02:55:10,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495 [2023-08-04 02:55:10,587 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-04 02:55:10,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-04 02:55:10,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:10,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-04 02:55:10,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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 02:55:10,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:10,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:10,589 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 519 flow. Second operand 4 states and 495 transitions. [2023-08-04 02:55:10,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 119 transitions, 1051 flow [2023-08-04 02:55:10,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 1039 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:10,826 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 531 flow [2023-08-04 02:55:10,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2023-08-04 02:55:10,826 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2023-08-04 02:55:10,826 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 531 flow [2023-08-04 02:55:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 02:55:10,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:10,827 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 02:55:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 02:55:10,827 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:10,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1239072794, now seen corresponding path program 1 times [2023-08-04 02:55:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522950482] [2023-08-04 02:55:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522950482] [2023-08-04 02:55:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522950482] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159021175] [2023-08-04 02:55:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:10,966 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 02:55:10,968 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 02:55:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:11,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:55:11,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:11,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:11,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159021175] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:11,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 02:55:11,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-04 02:55:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378383048] [2023-08-04 02:55:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:11,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:55:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:55:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:55:11,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-04 02:55:11,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 02:55:11,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:11,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-04 02:55:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:12,866 INFO L124 PetriNetUnfolderBase]: 12052/18580 cut-off events. [2023-08-04 02:55:12,866 INFO L125 PetriNetUnfolderBase]: For 132429/137774 co-relation queries the response was YES. [2023-08-04 02:55:12,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87156 conditions, 18580 events. 12052/18580 cut-off events. For 132429/137774 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 123318 event pairs, 5736 based on Foata normal form. 3758/21833 useless extension candidates. Maximal degree in co-relation 85999. Up to 15198 conditions per place. [2023-08-04 02:55:12,967 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 98 selfloop transitions, 7 changer transitions 15/129 dead transitions. [2023-08-04 02:55:12,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 1203 flow [2023-08-04 02:55:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-04 02:55:12,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502 [2023-08-04 02:55:12,970 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-04 02:55:12,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-04 02:55:12,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:12,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-04 02:55:12,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states 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 02:55:12,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:12,973 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:12,973 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 531 flow. Second operand 4 states and 502 transitions. [2023-08-04 02:55:12,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 1203 flow [2023-08-04 02:55:13,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 129 transitions, 1183 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 02:55:13,088 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 573 flow [2023-08-04 02:55:13,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=573, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2023-08-04 02:55:13,088 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-08-04 02:55:13,088 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 573 flow [2023-08-04 02:55:13,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 02:55:13,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:13,089 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 02:55:13,093 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 02:55:13,289 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,SelfDestructingSolverStorable20 [2023-08-04 02:55:13,290 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:13,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1160064343, now seen corresponding path program 1 times [2023-08-04 02:55:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267935534] [2023-08-04 02:55:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:55:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267935534] [2023-08-04 02:55:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267935534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655446856] [2023-08-04 02:55:13,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:13,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:13,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-08-04 02:55:13,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 573 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 02:55:13,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:13,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-08-04 02:55:13,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:15,282 INFO L124 PetriNetUnfolderBase]: 11808/17654 cut-off events. [2023-08-04 02:55:15,282 INFO L125 PetriNetUnfolderBase]: For 125736/129090 co-relation queries the response was YES. [2023-08-04 02:55:15,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87842 conditions, 17654 events. 11808/17654 cut-off events. For 125736/129090 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 109597 event pairs, 4144 based on Foata normal form. 3666/21233 useless extension candidates. Maximal degree in co-relation 86987. Up to 11430 conditions per place. [2023-08-04 02:55:15,383 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 141 selfloop transitions, 15 changer transitions 27/190 dead transitions. [2023-08-04 02:55:15,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 190 transitions, 1815 flow [2023-08-04 02:55:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 02:55:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 02:55:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-04 02:55:15,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-08-04 02:55:15,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-04 02:55:15,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-04 02:55:15,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:15,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-04 02:55:15,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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 02:55:15,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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 02:55:15,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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 02:55:15,389 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 573 flow. Second operand 6 states and 745 transitions. [2023-08-04 02:55:15,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 190 transitions, 1815 flow [2023-08-04 02:55:15,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 190 transitions, 1809 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:15,493 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 672 flow [2023-08-04 02:55:15,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2023-08-04 02:55:15,493 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2023-08-04 02:55:15,493 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 672 flow [2023-08-04 02:55:15,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 02:55:15,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:15,494 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 02:55:15,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 02:55:15,494 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:15,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 701790343, now seen corresponding path program 2 times [2023-08-04 02:55:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648647064] [2023-08-04 02:55:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648647064] [2023-08-04 02:55:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648647064] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043026732] [2023-08-04 02:55:15,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:15,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:15,589 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 02:55:15,606 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 02:55:15,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:15,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:15,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:55:15,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:15,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043026732] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:15,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:55:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681615264] [2023-08-04 02:55:15,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:15,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:15,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-04 02:55:15,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 672 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states 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 02:55:15,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:15,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-04 02:55:15,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:17,625 INFO L124 PetriNetUnfolderBase]: 11484/16745 cut-off events. [2023-08-04 02:55:17,626 INFO L125 PetriNetUnfolderBase]: For 169444/172102 co-relation queries the response was YES. [2023-08-04 02:55:17,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91721 conditions, 16745 events. 11484/16745 cut-off events. For 169444/172102 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 96267 event pairs, 4503 based on Foata normal form. 2812/19479 useless extension candidates. Maximal degree in co-relation 91083. Up to 11567 conditions per place. [2023-08-04 02:55:17,743 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 119 selfloop transitions, 29 changer transitions 12/167 dead transitions. [2023-08-04 02:55:17,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1799 flow [2023-08-04 02:55:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-08-04 02:55:17,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888 [2023-08-04 02:55:17,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-08-04 02:55:17,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-08-04 02:55:17,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:17,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-08-04 02:55:17,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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 02:55:17,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:17,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:17,749 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 672 flow. Second operand 5 states and 611 transitions. [2023-08-04 02:55:17,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1799 flow [2023-08-04 02:55:17,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 167 transitions, 1680 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-08-04 02:55:17,869 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 967 flow [2023-08-04 02:55:17,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=967, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-04 02:55:17,870 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2023-08-04 02:55:17,870 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 967 flow [2023-08-04 02:55:17,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states 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 02:55:17,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:17,870 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 02:55:17,878 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 02:55:18,074 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,SelfDestructingSolverStorable22 [2023-08-04 02:55:18,075 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:18,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2116954708, now seen corresponding path program 1 times [2023-08-04 02:55:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586692572] [2023-08-04 02:55:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586692572] [2023-08-04 02:55:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586692572] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27221735] [2023-08-04 02:55:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:18,188 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 02:55:18,212 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 02:55:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:18,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:55:18,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:18,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:18,384 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 02:55:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27221735] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:18,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 02:55:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-04 02:55:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985778531] [2023-08-04 02:55:18,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:18,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:55:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:55:18,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:55:18,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-04 02:55:18,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 967 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:18,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:18,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-04 02:55:18,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:20,723 INFO L124 PetriNetUnfolderBase]: 14689/20503 cut-off events. [2023-08-04 02:55:20,723 INFO L125 PetriNetUnfolderBase]: For 227021/235031 co-relation queries the response was YES. [2023-08-04 02:55:20,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119687 conditions, 20503 events. 14689/20503 cut-off events. For 227021/235031 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 112606 event pairs, 3953 based on Foata normal form. 3120/22914 useless extension candidates. Maximal degree in co-relation 119064. Up to 16868 conditions per place. [2023-08-04 02:55:20,851 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 120 selfloop transitions, 17 changer transitions 3/151 dead transitions. [2023-08-04 02:55:20,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 151 transitions, 1851 flow [2023-08-04 02:55:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 02:55:20,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487 [2023-08-04 02:55:20,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 02:55:20,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 02:55:20,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:20,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 02:55:20,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 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 02:55:20,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:20,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:20,858 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 967 flow. Second operand 4 states and 487 transitions. [2023-08-04 02:55:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 151 transitions, 1851 flow [2023-08-04 02:55:21,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 151 transitions, 1731 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:21,004 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 1003 flow [2023-08-04 02:55:21,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1003, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2023-08-04 02:55:21,004 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2023-08-04 02:55:21,005 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 1003 flow [2023-08-04 02:55:21,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:21,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:21,005 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 02:55:21,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 02:55:21,205 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,SelfDestructingSolverStorable23 [2023-08-04 02:55:21,206 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:21,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash -30534766, now seen corresponding path program 1 times [2023-08-04 02:55:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246505673] [2023-08-04 02:55:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:21,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:21,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:21,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246505673] [2023-08-04 02:55:21,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246505673] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:21,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696703278] [2023-08-04 02:55:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:21,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:21,325 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 02:55:21,327 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 02:55:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:21,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:55:21,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:21,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:21,512 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 02:55:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696703278] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:21,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2023-08-04 02:55:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477440758] [2023-08-04 02:55:21,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:21,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 02:55:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:21,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 02:55:21,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-04 02:55:21,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-04 02:55:21,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 1003 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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 02:55:21,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:21,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-04 02:55:21,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:24,491 INFO L124 PetriNetUnfolderBase]: 20791/28553 cut-off events. [2023-08-04 02:55:24,491 INFO L125 PetriNetUnfolderBase]: For 320027/326212 co-relation queries the response was YES. [2023-08-04 02:55:24,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173820 conditions, 28553 events. 20791/28553 cut-off events. For 320027/326212 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 157915 event pairs, 4894 based on Foata normal form. 3284/31656 useless extension candidates. Maximal degree in co-relation 173062. Up to 15951 conditions per place. [2023-08-04 02:55:24,727 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 245 selfloop transitions, 70 changer transitions 6/329 dead transitions. [2023-08-04 02:55:24,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 329 transitions, 4123 flow [2023-08-04 02:55:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 02:55:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 02:55:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-08-04 02:55:24,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835 [2023-08-04 02:55:24,730 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-08-04 02:55:24,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-08-04 02:55:24,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:24,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-08-04 02:55:24,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states 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 02:55:24,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states 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 02:55:24,735 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states 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 02:55:24,735 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 1003 flow. Second operand 8 states and 967 transitions. [2023-08-04 02:55:24,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 329 transitions, 4123 flow [2023-08-04 02:55:25,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 329 transitions, 4099 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:25,161 INFO L231 Difference]: Finished difference. Result has 102 places, 152 transitions, 2098 flow [2023-08-04 02:55:25,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2098, PETRI_PLACES=102, PETRI_TRANSITIONS=152} [2023-08-04 02:55:25,162 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-04 02:55:25,162 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 152 transitions, 2098 flow [2023-08-04 02:55:25,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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 02:55:25,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:25,162 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 02:55:25,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 02:55:25,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:25,368 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:25,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1509723924, now seen corresponding path program 2 times [2023-08-04 02:55:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976186270] [2023-08-04 02:55:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:55:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976186270] [2023-08-04 02:55:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976186270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019791702] [2023-08-04 02:55:25,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:25,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:25,459 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 02:55:25,471 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 02:55:25,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:25,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:25,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:55:25,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:55:25,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:55:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019791702] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:25,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:55:25,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358959339] [2023-08-04 02:55:25,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:25,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:25,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-04 02:55:25,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 152 transitions, 2098 flow. Second operand has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 02:55:25,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:25,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-04 02:55:25,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:28,738 INFO L124 PetriNetUnfolderBase]: 20737/27500 cut-off events. [2023-08-04 02:55:28,738 INFO L125 PetriNetUnfolderBase]: For 421930/428078 co-relation queries the response was YES. [2023-08-04 02:55:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192889 conditions, 27500 events. 20737/27500 cut-off events. For 421930/428078 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 138298 event pairs, 4022 based on Foata normal form. 3330/30786 useless extension candidates. Maximal degree in co-relation 192242. Up to 15708 conditions per place. [2023-08-04 02:55:28,975 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 165 selfloop transitions, 109 changer transitions 4/286 dead transitions. [2023-08-04 02:55:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 286 transitions, 4215 flow [2023-08-04 02:55:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 02:55:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 02:55:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-04 02:55:28,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478 [2023-08-04 02:55:28,977 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-04 02:55:28,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-04 02:55:28,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:28,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-04 02:55:28,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 02:55:28,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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 02:55:28,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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 02:55:28,980 INFO L175 Difference]: Start difference. First operand has 102 places, 152 transitions, 2098 flow. Second operand 6 states and 717 transitions. [2023-08-04 02:55:28,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 286 transitions, 4215 flow [2023-08-04 02:55:29,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 286 transitions, 4203 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-04 02:55:29,364 INFO L231 Difference]: Finished difference. Result has 110 places, 200 transitions, 3295 flow [2023-08-04 02:55:29,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3295, PETRI_PLACES=110, PETRI_TRANSITIONS=200} [2023-08-04 02:55:29,365 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-04 02:55:29,365 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 200 transitions, 3295 flow [2023-08-04 02:55:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states 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 02:55:29,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:29,365 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 02:55:29,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 02:55:29,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 02:55:29,568 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:29,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1049665534, now seen corresponding path program 1 times [2023-08-04 02:55:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332313700] [2023-08-04 02:55:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:55:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332313700] [2023-08-04 02:55:29,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332313700] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163134888] [2023-08-04 02:55:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:29,750 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 02:55:29,753 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 02:55:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:29,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-04 02:55:29,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:29,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163134888] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:30,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:30,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 4 [2023-08-04 02:55:30,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746510989] [2023-08-04 02:55:30,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:30,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 02:55:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 02:55:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:55:30,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:55:30,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 200 transitions, 3295 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 02:55:30,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:30,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:55:30,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:36,537 INFO L124 PetriNetUnfolderBase]: 40307/54414 cut-off events. [2023-08-04 02:55:36,537 INFO L125 PetriNetUnfolderBase]: For 1193930/1220175 co-relation queries the response was YES. [2023-08-04 02:55:36,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409013 conditions, 54414 events. 40307/54414 cut-off events. For 1193930/1220175 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 318692 event pairs, 4925 based on Foata normal form. 12485/63680 useless extension candidates. Maximal degree in co-relation 407723. Up to 31158 conditions per place. [2023-08-04 02:55:37,387 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 206 selfloop transitions, 166 changer transitions 1/392 dead transitions. [2023-08-04 02:55:37,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 392 transitions, 6769 flow [2023-08-04 02:55:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:55:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:55:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-04 02:55:37,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527 [2023-08-04 02:55:37,389 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-04 02:55:37,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-04 02:55:37,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:37,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-04 02:55:37,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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 02:55:37,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:37,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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 02:55:37,392 INFO L175 Difference]: Start difference. First operand has 110 places, 200 transitions, 3295 flow. Second operand 4 states and 527 transitions. [2023-08-04 02:55:37,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 392 transitions, 6769 flow [2023-08-04 02:55:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 392 transitions, 6423 flow, removed 122 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:38,850 INFO L231 Difference]: Finished difference. Result has 112 places, 331 transitions, 6249 flow [2023-08-04 02:55:38,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6249, PETRI_PLACES=112, PETRI_TRANSITIONS=331} [2023-08-04 02:55:38,850 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2023-08-04 02:55:38,850 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 331 transitions, 6249 flow [2023-08-04 02:55:38,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 02:55:38,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:38,851 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 02:55:38,855 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 02:55:39,051 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 02:55:39,052 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:39,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 603698620, now seen corresponding path program 2 times [2023-08-04 02:55:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489048326] [2023-08-04 02:55:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:55:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489048326] [2023-08-04 02:55:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489048326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772568038] [2023-08-04 02:55:39,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:39,289 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 02:55:39,314 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 02:55:39,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:39,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:39,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-04 02:55:39,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:39,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772568038] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:39,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-04 02:55:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239709388] [2023-08-04 02:55:39,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:39,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:39,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-08-04 02:55:39,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 331 transitions, 6249 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 02:55:39,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:39,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-08-04 02:55:39,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:52,167 INFO L124 PetriNetUnfolderBase]: 78062/105759 cut-off events. [2023-08-04 02:55:52,168 INFO L125 PetriNetUnfolderBase]: For 2772995/2810154 co-relation queries the response was YES. [2023-08-04 02:55:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869809 conditions, 105759 events. 78062/105759 cut-off events. For 2772995/2810154 co-relation queries the response was YES. Maximal size of possible extension queue 2843. Compared 680145 event pairs, 8329 based on Foata normal form. 19401/119286 useless extension candidates. Maximal degree in co-relation 867744. Up to 59814 conditions per place. [2023-08-04 02:55:53,725 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 237 selfloop transitions, 379 changer transitions 1/636 dead transitions. [2023-08-04 02:55:53,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 636 transitions, 12211 flow [2023-08-04 02:55:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-04 02:55:53,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328 [2023-08-04 02:55:53,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-04 02:55:53,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-04 02:55:53,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:53,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-04 02:55:53,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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 02:55:53,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:53,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 02:55:53,729 INFO L175 Difference]: Start difference. First operand has 112 places, 331 transitions, 6249 flow. Second operand 5 states and 666 transitions. [2023-08-04 02:55:53,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 636 transitions, 12211 flow [2023-08-04 02:56:08,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 636 transitions, 12211 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:56:08,914 INFO L231 Difference]: Finished difference. Result has 119 places, 544 transitions, 12194 flow [2023-08-04 02:56:08,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=6249, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12194, PETRI_PLACES=119, PETRI_TRANSITIONS=544} [2023-08-04 02:56:08,915 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2023-08-04 02:56:08,915 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 544 transitions, 12194 flow [2023-08-04 02:56:08,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 02:56:08,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:08,916 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 02:56:08,923 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 02:56:09,120 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,SelfDestructingSolverStorable27 [2023-08-04 02:56:09,121 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:09,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1540816916, now seen corresponding path program 1 times [2023-08-04 02:56:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559273966] [2023-08-04 02:56:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559273966] [2023-08-04 02:56:09,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559273966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245454849] [2023-08-04 02:56:09,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:09,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:09,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:09,290 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 02:56:09,293 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 02:56:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:09,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-04 02:56:09,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:09,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:56:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245454849] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:56:09,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:56:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2023-08-04 02:56:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742195513] [2023-08-04 02:56:09,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:56:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 02:56:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 02:56:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-08-04 02:56:09,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-04 02:56:09,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 544 transitions, 12194 flow. Second operand has 14 states, 14 states have (on average 105.07142857142857) internal successors, (1471), 14 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states 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 02:56:09,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:09,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-04 02:56:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand