/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 15:38:29,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 15:38:29,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 15:38:29,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 15:38:29,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 15:38:29,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 15:38:29,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 15:38:29,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 15:38:29,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 15:38:29,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 15:38:29,530 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 15:38:29,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 15:38:29,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 15:38:29,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 15:38:29,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 15:38:29,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 15:38:29,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 15:38:29,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 15:38:29,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 15:38:29,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 15:38:29,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 15:38:29,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 15:38:29,533 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 15:38:29,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 15:38:29,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 15:38:29,534 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 15:38:29,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 15:38:29,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:38:29,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 15:38:29,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 15:38:29,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 15:38:29,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 15:38:29,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 15:38:29,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 15:38:29,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 15:38:29,536 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 15:38:29,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 15:38:29,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 15:38:29,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 15:38:29,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 15:38:29,789 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 15:38:29,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2023-08-24 15:38:30,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 15:38:30,921 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 15:38:30,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2023-08-24 15:38:30,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4a110db/63462c3684b843c2b764c5f1239a23ee/FLAGb834f231e [2023-08-24 15:38:30,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4a110db/63462c3684b843c2b764c5f1239a23ee [2023-08-24 15:38:30,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 15:38:30,938 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 15:38:30,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 15:38:30,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 15:38:30,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 15:38:30,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:38:30" (1/1) ... [2023-08-24 15:38:30,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c820a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:30, skipping insertion in model container [2023-08-24 15:38:30,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:38:30" (1/1) ... [2023-08-24 15:38:30,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 15:38:31,087 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2023-08-24 15:38:31,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:38:31,103 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 15:38:31,131 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2023-08-24 15:38:31,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:38:31,138 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:38:31,138 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:38:31,143 INFO L206 MainTranslator]: Completed translation [2023-08-24 15:38:31,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31 WrapperNode [2023-08-24 15:38:31,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 15:38:31,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 15:38:31,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 15:38:31,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 15:38:31,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,181 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-08-24 15:38:31,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 15:38:31,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 15:38:31,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 15:38:31,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 15:38:31,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 15:38:31,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 15:38:31,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 15:38:31,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 15:38:31,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (1/1) ... [2023-08-24 15:38:31,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:38:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:31,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 15:38:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 15:38:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 15:38:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 15:38:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 15:38:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 15:38:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 15:38:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 15:38:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 15:38:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 15:38:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 15:38:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 15:38:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 15:38:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 15:38:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 15:38:31,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 15:38:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 15:38:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 15:38:31,278 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 15:38:31,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 15:38:31,360 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 15:38:31,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 15:38:31,525 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 15:38:31,564 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 15:38:31,564 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 15:38:31,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:38:31 BoogieIcfgContainer [2023-08-24 15:38:31,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 15:38:31,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 15:38:31,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 15:38:31,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 15:38:31,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:38:30" (1/3) ... [2023-08-24 15:38:31,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b95af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:38:31, skipping insertion in model container [2023-08-24 15:38:31,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:38:31" (2/3) ... [2023-08-24 15:38:31,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b95af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:38:31, skipping insertion in model container [2023-08-24 15:38:31,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:38:31" (3/3) ... [2023-08-24 15:38:31,571 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2023-08-24 15:38:31,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 15:38:31,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 15:38:31,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 15:38:31,644 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 15:38:31,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 148 transitions, 320 flow [2023-08-24 15:38:31,788 INFO L124 PetriNetUnfolderBase]: 12/145 cut-off events. [2023-08-24 15:38:31,788 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 15:38:31,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 12/145 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-08-24 15:38:31,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 148 transitions, 320 flow [2023-08-24 15:38:31,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 135 transitions, 288 flow [2023-08-24 15:38:31,801 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 15:38:31,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 135 transitions, 288 flow [2023-08-24 15:38:31,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 135 transitions, 288 flow [2023-08-24 15:38:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 135 transitions, 288 flow [2023-08-24 15:38:31,845 INFO L124 PetriNetUnfolderBase]: 12/135 cut-off events. [2023-08-24 15:38:31,846 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 15:38:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 12/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-08-24 15:38:31,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-08-24 15:38:35,226 INFO L134 LiptonReduction]: Checked pairs total: 1676 [2023-08-24 15:38:35,226 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-24 15:38:35,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 15:38:35,239 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e1355ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 15:38:35,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 15:38:35,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 15:38:35,242 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-08-24 15:38:35,242 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 15:38:35,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:35,243 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] [2023-08-24 15:38:35,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:35,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1009444864, now seen corresponding path program 1 times [2023-08-24 15:38:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058961292] [2023-08-24 15:38:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058961292] [2023-08-24 15:38:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058961292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:38:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:38:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:38:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533467068] [2023-08-24 15:38:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:38:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:38:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:38:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:38:35,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 280 [2023-08-24 15:38:35,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:35,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:35,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 280 [2023-08-24 15:38:35,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:35,924 INFO L124 PetriNetUnfolderBase]: 441/639 cut-off events. [2023-08-24 15:38:35,924 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-08-24 15:38:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 639 events. 441/639 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2251 event pairs, 76 based on Foata normal form. 2/394 useless extension candidates. Maximal degree in co-relation 803. Up to 465 conditions per place. [2023-08-24 15:38:35,932 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 46 selfloop transitions, 8 changer transitions 2/59 dead transitions. [2023-08-24 15:38:35,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 59 transitions, 281 flow [2023-08-24 15:38:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:38:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:38:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-08-24 15:38:35,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2023-08-24 15:38:35,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-08-24 15:38:35,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-08-24 15:38:35,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:35,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-08-24 15:38:35,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:35,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:35,964 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:35,965 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 4 states and 518 transitions. [2023-08-24 15:38:35,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 59 transitions, 281 flow [2023-08-24 15:38:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 59 transitions, 247 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 15:38:35,972 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 105 flow [2023-08-24 15:38:35,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2023-08-24 15:38:35,976 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-24 15:38:35,977 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 105 flow [2023-08-24 15:38:35,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:35,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:35,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:38:35,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 15:38:35,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:35,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -802388598, now seen corresponding path program 1 times [2023-08-24 15:38:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111767601] [2023-08-24 15:38:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:36,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111767601] [2023-08-24 15:38:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111767601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:38:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:38:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 15:38:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208215533] [2023-08-24 15:38:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:38:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:38:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:38:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:38:36,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 280 [2023-08-24 15:38:36,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:36,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 280 [2023-08-24 15:38:36,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:36,183 INFO L124 PetriNetUnfolderBase]: 336/500 cut-off events. [2023-08-24 15:38:36,183 INFO L125 PetriNetUnfolderBase]: For 147/150 co-relation queries the response was YES. [2023-08-24 15:38:36,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 500 events. 336/500 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1748 event pairs, 170 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 1220. Up to 484 conditions per place. [2023-08-24 15:38:36,186 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-24 15:38:36,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 142 flow [2023-08-24 15:38:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 15:38:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 15:38:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-24 15:38:36,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2023-08-24 15:38:36,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-24 15:38:36,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-24 15:38:36,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:36,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-24 15:38:36,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-24 15:38:36,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,193 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 105 flow. Second operand 3 states and 342 transitions. [2023-08-24 15:38:36,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 142 flow [2023-08-24 15:38:36,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 138 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 15:38:36,198 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 94 flow [2023-08-24 15:38:36,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-24 15:38:36,200 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-24 15:38:36,201 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 94 flow [2023-08-24 15:38:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:36,207 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] [2023-08-24 15:38:36,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 15:38:36,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:36,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash 283968075, now seen corresponding path program 1 times [2023-08-24 15:38:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634508380] [2023-08-24 15:38:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634508380] [2023-08-24 15:38:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634508380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611320175] [2023-08-24 15:38:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:36,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:36,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 15:38:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:36,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:38:36,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:36,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611320175] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 15:38:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2023-08-24 15:38:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151651699] [2023-08-24 15:38:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:38:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 15:38:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 15:38:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-08-24 15:38:36,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:38:36,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:36,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:38:36,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:36,771 INFO L124 PetriNetUnfolderBase]: 404/586 cut-off events. [2023-08-24 15:38:36,771 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-08-24 15:38:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 586 events. 404/586 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 94 based on Foata normal form. 44/628 useless extension candidates. Maximal degree in co-relation 1445. Up to 261 conditions per place. [2023-08-24 15:38:36,773 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 46 selfloop transitions, 13 changer transitions 0/60 dead transitions. [2023-08-24 15:38:36,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 310 flow [2023-08-24 15:38:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 15:38:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 15:38:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 837 transitions. [2023-08-24 15:38:36,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3736607142857143 [2023-08-24 15:38:36,775 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 837 transitions. [2023-08-24 15:38:36,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 837 transitions. [2023-08-24 15:38:36,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:36,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 837 transitions. [2023-08-24 15:38:36,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.625) internal successors, (837), 8 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,780 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,781 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 94 flow. Second operand 8 states and 837 transitions. [2023-08-24 15:38:36,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 310 flow [2023-08-24 15:38:36,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 295 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:36,782 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 146 flow [2023-08-24 15:38:36,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=146, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2023-08-24 15:38:36,783 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-24 15:38:36,783 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 146 flow [2023-08-24 15:38:36,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:36,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:36,783 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] [2023-08-24 15:38:36,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 15:38:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:36,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:36,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 782105989, now seen corresponding path program 1 times [2023-08-24 15:38:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87449958] [2023-08-24 15:38:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87449958] [2023-08-24 15:38:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87449958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916151599] [2023-08-24 15:38:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:37,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:37,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:37,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 15:38:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:37,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 15:38:37,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:37,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916151599] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:37,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 15:38:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-24 15:38:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967310979] [2023-08-24 15:38:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:38:37,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:38:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:38:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 15:38:37,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 280 [2023-08-24 15:38:37,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:37,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:37,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 280 [2023-08-24 15:38:37,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:37,296 INFO L124 PetriNetUnfolderBase]: 341/506 cut-off events. [2023-08-24 15:38:37,297 INFO L125 PetriNetUnfolderBase]: For 575/634 co-relation queries the response was YES. [2023-08-24 15:38:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 506 events. 341/506 cut-off events. For 575/634 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1699 event pairs, 85 based on Foata normal form. 67/561 useless extension candidates. Maximal degree in co-relation 1560. Up to 380 conditions per place. [2023-08-24 15:38:37,299 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-24 15:38:37,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 314 flow [2023-08-24 15:38:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:38:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:38:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2023-08-24 15:38:37,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285714285714286 [2023-08-24 15:38:37,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2023-08-24 15:38:37,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2023-08-24 15:38:37,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:37,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2023-08-24 15:38:37,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-24 15:38:37,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:37,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:37,304 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 146 flow. Second operand 5 states and 564 transitions. [2023-08-24 15:38:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 314 flow [2023-08-24 15:38:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 291 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:37,306 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 152 flow [2023-08-24 15:38:37,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-24 15:38:37,307 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-24 15:38:37,307 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 152 flow [2023-08-24 15:38:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:37,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:37,308 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] [2023-08-24 15:38:37,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 15:38:37,512 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-24 15:38:37,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:37,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1804398087, now seen corresponding path program 1 times [2023-08-24 15:38:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:37,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021586768] [2023-08-24 15:38:37,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:37,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021586768] [2023-08-24 15:38:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021586768] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177722248] [2023-08-24 15:38:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:38,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:38,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:38,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 15:38:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:38,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 15:38:38,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:38,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:38:38,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:38:38,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:38:38,730 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:38,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 37 [2023-08-24 15:38:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:38,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:38,963 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:38,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 99 [2023-08-24 15:38:38,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2023-08-24 15:38:38,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2023-08-24 15:38:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177722248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:39,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 26 [2023-08-24 15:38:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355837251] [2023-08-24 15:38:39,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:39,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 15:38:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 15:38:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=634, Unknown=4, NotChecked=0, Total=756 [2023-08-24 15:38:39,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 280 [2023-08-24 15:38:39,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 152 flow. Second operand has 28 states, 28 states have (on average 77.25) internal successors, (2163), 28 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:39,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:39,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 280 [2023-08-24 15:38:39,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:44,470 INFO L124 PetriNetUnfolderBase]: 843/1254 cut-off events. [2023-08-24 15:38:44,470 INFO L125 PetriNetUnfolderBase]: For 1170/1170 co-relation queries the response was YES. [2023-08-24 15:38:44,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4122 conditions, 1254 events. 843/1254 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4705 event pairs, 48 based on Foata normal form. 8/1262 useless extension candidates. Maximal degree in co-relation 3209. Up to 695 conditions per place. [2023-08-24 15:38:44,476 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 132 selfloop transitions, 59 changer transitions 7/198 dead transitions. [2023-08-24 15:38:44,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 198 transitions, 1182 flow [2023-08-24 15:38:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 15:38:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 15:38:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1597 transitions. [2023-08-24 15:38:44,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.300187969924812 [2023-08-24 15:38:44,480 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1597 transitions. [2023-08-24 15:38:44,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1597 transitions. [2023-08-24 15:38:44,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:44,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1597 transitions. [2023-08-24 15:38:44,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 84.05263157894737) internal successors, (1597), 19 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:44,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 280.0) internal successors, (5600), 20 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:44,488 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 280.0) internal successors, (5600), 20 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:44,488 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 152 flow. Second operand 19 states and 1597 transitions. [2023-08-24 15:38:44,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 198 transitions, 1182 flow [2023-08-24 15:38:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 198 transitions, 1157 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:44,494 INFO L231 Difference]: Finished difference. Result has 65 places, 87 transitions, 615 flow [2023-08-24 15:38:44,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=615, PETRI_PLACES=65, PETRI_TRANSITIONS=87} [2023-08-24 15:38:44,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2023-08-24 15:38:44,495 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 87 transitions, 615 flow [2023-08-24 15:38:44,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.25) internal successors, (2163), 28 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:44,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:44,496 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] [2023-08-24 15:38:44,503 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-24 15:38:44,700 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-24 15:38:44,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:44,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 184922273, now seen corresponding path program 2 times [2023-08-24 15:38:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720099261] [2023-08-24 15:38:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:45,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:45,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720099261] [2023-08-24 15:38:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720099261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:45,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844902352] [2023-08-24 15:38:45,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:38:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:45,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:45,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 15:38:45,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:38:45,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:45,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 15:38:45,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:45,526 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:45,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 42 [2023-08-24 15:38:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:45,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:45,782 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:45,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:38:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844902352] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:46,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-24 15:38:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72620556] [2023-08-24 15:38:46,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:46,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 15:38:46,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 15:38:46,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2023-08-24 15:38:46,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:38:46,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 87 transitions, 615 flow. Second operand has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:46,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:46,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:38:46,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:47,495 INFO L124 PetriNetUnfolderBase]: 1273/1899 cut-off events. [2023-08-24 15:38:47,495 INFO L125 PetriNetUnfolderBase]: For 4976/4976 co-relation queries the response was YES. [2023-08-24 15:38:47,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 1899 events. 1273/1899 cut-off events. For 4976/4976 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7727 event pairs, 163 based on Foata normal form. 3/1902 useless extension candidates. Maximal degree in co-relation 7928. Up to 1219 conditions per place. [2023-08-24 15:38:47,504 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 151 selfloop transitions, 137 changer transitions 12/300 dead transitions. [2023-08-24 15:38:47,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 300 transitions, 2355 flow [2023-08-24 15:38:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-24 15:38:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-24 15:38:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2838 transitions. [2023-08-24 15:38:47,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30714285714285716 [2023-08-24 15:38:47,511 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2838 transitions. [2023-08-24 15:38:47,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2838 transitions. [2023-08-24 15:38:47,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:47,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2838 transitions. [2023-08-24 15:38:47,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 86.0) internal successors, (2838), 33 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:47,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 280.0) internal successors, (9520), 34 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:47,524 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 280.0) internal successors, (9520), 34 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:47,524 INFO L175 Difference]: Start difference. First operand has 65 places, 87 transitions, 615 flow. Second operand 33 states and 2838 transitions. [2023-08-24 15:38:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 300 transitions, 2355 flow [2023-08-24 15:38:47,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 300 transitions, 2236 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:47,543 INFO L231 Difference]: Finished difference. Result has 108 places, 193 transitions, 1742 flow [2023-08-24 15:38:47,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1742, PETRI_PLACES=108, PETRI_TRANSITIONS=193} [2023-08-24 15:38:47,544 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2023-08-24 15:38:47,544 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 193 transitions, 1742 flow [2023-08-24 15:38:47,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:47,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:47,545 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] [2023-08-24 15:38:47,552 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-24 15:38:47,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:47,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:47,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2117839763, now seen corresponding path program 3 times [2023-08-24 15:38:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480940261] [2023-08-24 15:38:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480940261] [2023-08-24 15:38:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480940261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690371280] [2023-08-24 15:38:48,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:38:48,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:48,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:48,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:48,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 15:38:48,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 15:38:48,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:48,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 15:38:48,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:48,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:48,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 71 [2023-08-24 15:38:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:48,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:48,905 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:48,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:38:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690371280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:49,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2023-08-24 15:38:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340325218] [2023-08-24 15:38:49,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:49,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:38:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:38:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-08-24 15:38:49,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:38:49,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 193 transitions, 1742 flow. Second operand has 29 states, 29 states have (on average 81.10344827586206) internal successors, (2352), 29 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:49,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:49,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:38:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:50,212 INFO L124 PetriNetUnfolderBase]: 1372/2083 cut-off events. [2023-08-24 15:38:50,212 INFO L125 PetriNetUnfolderBase]: For 8950/8950 co-relation queries the response was YES. [2023-08-24 15:38:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 2083 events. 1372/2083 cut-off events. For 8950/8950 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8909 event pairs, 234 based on Foata normal form. 1/2084 useless extension candidates. Maximal degree in co-relation 10468. Up to 1734 conditions per place. [2023-08-24 15:38:50,225 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 157 selfloop transitions, 121 changer transitions 6/284 dead transitions. [2023-08-24 15:38:50,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 284 transitions, 2900 flow [2023-08-24 15:38:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 15:38:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 15:38:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1527 transitions. [2023-08-24 15:38:50,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30297619047619045 [2023-08-24 15:38:50,228 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1527 transitions. [2023-08-24 15:38:50,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1527 transitions. [2023-08-24 15:38:50,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:50,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1527 transitions. [2023-08-24 15:38:50,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 84.83333333333333) internal successors, (1527), 18 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:50,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 280.0) internal successors, (5320), 19 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:50,236 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 280.0) internal successors, (5320), 19 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:50,236 INFO L175 Difference]: Start difference. First operand has 108 places, 193 transitions, 1742 flow. Second operand 18 states and 1527 transitions. [2023-08-24 15:38:50,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 284 transitions, 2900 flow [2023-08-24 15:38:50,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 284 transitions, 2559 flow, removed 134 selfloop flow, removed 4 redundant places. [2023-08-24 15:38:50,265 INFO L231 Difference]: Finished difference. Result has 125 places, 241 transitions, 2181 flow [2023-08-24 15:38:50,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2181, PETRI_PLACES=125, PETRI_TRANSITIONS=241} [2023-08-24 15:38:50,266 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2023-08-24 15:38:50,266 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 241 transitions, 2181 flow [2023-08-24 15:38:50,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 81.10344827586206) internal successors, (2352), 29 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:50,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:50,267 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] [2023-08-24 15:38:50,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 15:38:50,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:50,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:50,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash -204807787, now seen corresponding path program 4 times [2023-08-24 15:38:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574660363] [2023-08-24 15:38:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574660363] [2023-08-24 15:38:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574660363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253125474] [2023-08-24 15:38:50,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:38:50,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:50,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:50,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:50,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 15:38:50,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:38:50,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:50,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 15:38:50,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:51,141 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:51,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 71 [2023-08-24 15:38:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:51,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:51,421 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:51,422 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:38:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253125474] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:51,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2023-08-24 15:38:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488742147] [2023-08-24 15:38:51,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 15:38:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 15:38:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2023-08-24 15:38:51,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:38:51,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 241 transitions, 2181 flow. Second operand has 25 states, 25 states have (on average 81.44) internal successors, (2036), 25 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:51,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:51,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:38:51,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:52,693 INFO L124 PetriNetUnfolderBase]: 1667/2518 cut-off events. [2023-08-24 15:38:52,693 INFO L125 PetriNetUnfolderBase]: For 10035/10035 co-relation queries the response was YES. [2023-08-24 15:38:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12476 conditions, 2518 events. 1667/2518 cut-off events. For 10035/10035 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11176 event pairs, 147 based on Foata normal form. 2/2520 useless extension candidates. Maximal degree in co-relation 12427. Up to 1754 conditions per place. [2023-08-24 15:38:52,708 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 239 selfloop transitions, 195 changer transitions 16/450 dead transitions. [2023-08-24 15:38:52,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 450 transitions, 4573 flow [2023-08-24 15:38:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-24 15:38:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-24 15:38:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2301 transitions. [2023-08-24 15:38:52,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30436507936507934 [2023-08-24 15:38:52,713 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2301 transitions. [2023-08-24 15:38:52,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2301 transitions. [2023-08-24 15:38:52,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:52,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2301 transitions. [2023-08-24 15:38:52,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.22222222222223) internal successors, (2301), 27 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:52,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 280.0) internal successors, (7840), 28 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:52,723 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 280.0) internal successors, (7840), 28 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:52,723 INFO L175 Difference]: Start difference. First operand has 125 places, 241 transitions, 2181 flow. Second operand 27 states and 2301 transitions. [2023-08-24 15:38:52,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 450 transitions, 4573 flow [2023-08-24 15:38:52,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 450 transitions, 4455 flow, removed 33 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:52,764 INFO L231 Difference]: Finished difference. Result has 157 places, 346 transitions, 3626 flow [2023-08-24 15:38:52,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3626, PETRI_PLACES=157, PETRI_TRANSITIONS=346} [2023-08-24 15:38:52,766 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2023-08-24 15:38:52,766 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 346 transitions, 3626 flow [2023-08-24 15:38:52,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.44) internal successors, (2036), 25 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:52,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:52,766 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] [2023-08-24 15:38:52,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 15:38:52,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:52,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:52,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1129497761, now seen corresponding path program 5 times [2023-08-24 15:38:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72484557] [2023-08-24 15:38:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72484557] [2023-08-24 15:38:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72484557] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688457800] [2023-08-24 15:38:53,747 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:38:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:53,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:38:53,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 15:38:53,826 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:38:53,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:53,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 15:38:53,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:54,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:54,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 42 [2023-08-24 15:38:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:54,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:54,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:54,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:38:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688457800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:54,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 25 [2023-08-24 15:38:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673427890] [2023-08-24 15:38:54,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:54,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 15:38:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 15:38:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2023-08-24 15:38:54,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 280 [2023-08-24 15:38:54,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 346 transitions, 3626 flow. Second operand has 27 states, 27 states have (on average 71.37037037037037) internal successors, (1927), 27 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:54,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:54,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 280 [2023-08-24 15:38:54,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:56,231 INFO L124 PetriNetUnfolderBase]: 2019/3040 cut-off events. [2023-08-24 15:38:56,232 INFO L125 PetriNetUnfolderBase]: For 17021/17021 co-relation queries the response was YES. [2023-08-24 15:38:56,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17139 conditions, 3040 events. 2019/3040 cut-off events. For 17021/17021 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13963 event pairs, 219 based on Foata normal form. 2/3042 useless extension candidates. Maximal degree in co-relation 17080. Up to 2046 conditions per place. [2023-08-24 15:38:56,253 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 305 selfloop transitions, 196 changer transitions 9/510 dead transitions. [2023-08-24 15:38:56,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 510 transitions, 5805 flow [2023-08-24 15:38:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-24 15:38:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-24 15:38:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1768 transitions. [2023-08-24 15:38:56,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2745341614906832 [2023-08-24 15:38:56,256 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1768 transitions. [2023-08-24 15:38:56,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1768 transitions. [2023-08-24 15:38:56,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:56,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1768 transitions. [2023-08-24 15:38:56,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 76.8695652173913) internal successors, (1768), 23 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:56,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 280.0) internal successors, (6720), 24 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:56,263 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 280.0) internal successors, (6720), 24 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:56,263 INFO L175 Difference]: Start difference. First operand has 157 places, 346 transitions, 3626 flow. Second operand 23 states and 1768 transitions. [2023-08-24 15:38:56,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 510 transitions, 5805 flow [2023-08-24 15:38:56,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 510 transitions, 5308 flow, removed 225 selfloop flow, removed 5 redundant places. [2023-08-24 15:38:56,397 INFO L231 Difference]: Finished difference. Result has 180 places, 399 transitions, 4373 flow [2023-08-24 15:38:56,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3251, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4373, PETRI_PLACES=180, PETRI_TRANSITIONS=399} [2023-08-24 15:38:56,398 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2023-08-24 15:38:56,398 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 399 transitions, 4373 flow [2023-08-24 15:38:56,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 71.37037037037037) internal successors, (1927), 27 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:56,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:56,399 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] [2023-08-24 15:38:56,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 15:38:56,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:56,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:56,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash 622967403, now seen corresponding path program 6 times [2023-08-24 15:38:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:56,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531444948] [2023-08-24 15:38:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:57,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:57,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531444948] [2023-08-24 15:38:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531444948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:57,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657046299] [2023-08-24 15:38:57,045 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:38:57,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:57,062 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-24 15:38:57,109 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-24 15:38:57,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:38:57,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:57,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-24 15:38:57,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:57,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-08-24 15:38:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:57,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:57,660 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:57,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:38:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657046299] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:57,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2023-08-24 15:38:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877533951] [2023-08-24 15:38:57,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:57,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:38:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:38:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2023-08-24 15:38:57,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:38:57,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 399 transitions, 4373 flow. Second operand has 29 states, 29 states have (on average 81.13793103448276) internal successors, (2353), 29 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:57,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:57,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:38:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:58,899 INFO L124 PetriNetUnfolderBase]: 2019/3039 cut-off events. [2023-08-24 15:38:58,899 INFO L125 PetriNetUnfolderBase]: For 18934/18934 co-relation queries the response was YES. [2023-08-24 15:38:58,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18020 conditions, 3039 events. 2019/3039 cut-off events. For 18934/18934 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13906 event pairs, 308 based on Foata normal form. 1/3028 useless extension candidates. Maximal degree in co-relation 17954. Up to 2766 conditions per place. [2023-08-24 15:38:58,918 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 317 selfloop transitions, 109 changer transitions 6/432 dead transitions. [2023-08-24 15:38:58,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 432 transitions, 5382 flow [2023-08-24 15:38:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 15:38:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 15:38:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1110 transitions. [2023-08-24 15:38:58,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30494505494505497 [2023-08-24 15:38:58,931 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1110 transitions. [2023-08-24 15:38:58,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1110 transitions. [2023-08-24 15:38:58,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:58,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1110 transitions. [2023-08-24 15:38:58,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 85.38461538461539) internal successors, (1110), 13 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:58,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:58,936 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:58,936 INFO L175 Difference]: Start difference. First operand has 180 places, 399 transitions, 4373 flow. Second operand 13 states and 1110 transitions. [2023-08-24 15:38:58,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 432 transitions, 5382 flow [2023-08-24 15:38:58,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 432 transitions, 5231 flow, removed 53 selfloop flow, removed 7 redundant places. [2023-08-24 15:38:59,002 INFO L231 Difference]: Finished difference. Result has 186 places, 398 transitions, 4440 flow [2023-08-24 15:38:59,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4440, PETRI_PLACES=186, PETRI_TRANSITIONS=398} [2023-08-24 15:38:59,003 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2023-08-24 15:38:59,003 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 398 transitions, 4440 flow [2023-08-24 15:38:59,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 81.13793103448276) internal successors, (2353), 29 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:59,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:59,003 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] [2023-08-24 15:38:59,010 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-24 15:38:59,208 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,SelfDestructingSolverStorable9 [2023-08-24 15:38:59,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:38:59,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -36840239, now seen corresponding path program 7 times [2023-08-24 15:38:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117153048] [2023-08-24 15:38:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:38:59,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:59,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117153048] [2023-08-24 15:38:59,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117153048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:59,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735349460] [2023-08-24 15:38:59,776 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:38:59,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:59,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:59,777 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-24 15:38:59,780 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-24 15:38:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:59,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 15:38:59,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:00,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-08-24 15:39:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:00,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:00,259 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:00,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:39:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735349460] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:00,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-08-24 15:39:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69406052] [2023-08-24 15:39:00,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:00,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 15:39:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 15:39:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-08-24 15:39:00,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 280 [2023-08-24 15:39:00,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 398 transitions, 4440 flow. Second operand has 23 states, 23 states have (on average 85.56521739130434) internal successors, (1968), 23 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:00,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:00,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 280 [2023-08-24 15:39:00,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:01,147 INFO L124 PetriNetUnfolderBase]: 2136/3229 cut-off events. [2023-08-24 15:39:01,147 INFO L125 PetriNetUnfolderBase]: For 20349/20412 co-relation queries the response was YES. [2023-08-24 15:39:01,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18865 conditions, 3229 events. 2136/3229 cut-off events. For 20349/20412 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15449 event pairs, 327 based on Foata normal form. 30/3223 useless extension candidates. Maximal degree in co-relation 18799. Up to 2731 conditions per place. [2023-08-24 15:39:01,174 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 330 selfloop transitions, 109 changer transitions 1/455 dead transitions. [2023-08-24 15:39:01,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 455 transitions, 5683 flow [2023-08-24 15:39:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 15:39:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 15:39:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2023-08-24 15:39:01,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.326984126984127 [2023-08-24 15:39:01,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 824 transitions. [2023-08-24 15:39:01,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 824 transitions. [2023-08-24 15:39:01,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:01,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 824 transitions. [2023-08-24 15:39:01,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:01,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:01,179 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:01,179 INFO L175 Difference]: Start difference. First operand has 186 places, 398 transitions, 4440 flow. Second operand 9 states and 824 transitions. [2023-08-24 15:39:01,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 455 transitions, 5683 flow [2023-08-24 15:39:01,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 455 transitions, 5447 flow, removed 2 selfloop flow, removed 13 redundant places. [2023-08-24 15:39:01,250 INFO L231 Difference]: Finished difference. Result has 184 places, 421 transitions, 4749 flow [2023-08-24 15:39:01,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4216, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4749, PETRI_PLACES=184, PETRI_TRANSITIONS=421} [2023-08-24 15:39:01,251 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2023-08-24 15:39:01,251 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 421 transitions, 4749 flow [2023-08-24 15:39:01,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 85.56521739130434) internal successors, (1968), 23 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:01,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:01,252 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] [2023-08-24 15:39:01,258 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-24 15:39:01,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:01,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:01,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1443076611, now seen corresponding path program 8 times [2023-08-24 15:39:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280287231] [2023-08-24 15:39:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280287231] [2023-08-24 15:39:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280287231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368449172] [2023-08-24 15:39:01,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:39:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:01,934 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-24 15:39:01,961 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-24 15:39:02,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:02,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:02,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 15:39:02,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:02,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:39:02,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:39:02,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:02,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:39:02,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:02,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:39:02,461 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:02,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2023-08-24 15:39:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:02,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:04,060 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-08-24 15:39:04,068 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 161 [2023-08-24 15:39:04,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-08-24 15:39:04,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2023-08-24 15:39:04,089 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2023-08-24 15:39:04,190 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-08-24 15:39:04,199 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 324 [2023-08-24 15:39:04,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-08-24 15:39:04,217 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:04,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2023-08-24 15:39:04,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2023-08-24 15:39:04,357 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 15:39:04,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 1 [2023-08-24 15:39:04,364 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 15:39:04,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2023-08-24 15:39:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368449172] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:04,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 31 [2023-08-24 15:39:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601247231] [2023-08-24 15:39:04,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:04,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 15:39:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:04,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 15:39:04,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=886, Unknown=23, NotChecked=0, Total=1056 [2023-08-24 15:39:04,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 280 [2023-08-24 15:39:04,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 421 transitions, 4749 flow. Second operand has 33 states, 33 states have (on average 70.9090909090909) internal successors, (2340), 33 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:04,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 280 [2023-08-24 15:39:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:06,682 INFO L124 PetriNetUnfolderBase]: 3033/4486 cut-off events. [2023-08-24 15:39:06,683 INFO L125 PetriNetUnfolderBase]: For 27262/27262 co-relation queries the response was YES. [2023-08-24 15:39:06,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27022 conditions, 4486 events. 3033/4486 cut-off events. For 27262/27262 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21835 event pairs, 207 based on Foata normal form. 1/4473 useless extension candidates. Maximal degree in co-relation 26954. Up to 2358 conditions per place. [2023-08-24 15:39:06,709 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 360 selfloop transitions, 354 changer transitions 3/717 dead transitions. [2023-08-24 15:39:06,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 717 transitions, 8732 flow [2023-08-24 15:39:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-24 15:39:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-24 15:39:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1805 transitions. [2023-08-24 15:39:06,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2802795031055901 [2023-08-24 15:39:06,716 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1805 transitions. [2023-08-24 15:39:06,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1805 transitions. [2023-08-24 15:39:06,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:06,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1805 transitions. [2023-08-24 15:39:06,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 78.47826086956522) internal successors, (1805), 23 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:06,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 280.0) internal successors, (6720), 24 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:06,723 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 280.0) internal successors, (6720), 24 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:06,723 INFO L175 Difference]: Start difference. First operand has 184 places, 421 transitions, 4749 flow. Second operand 23 states and 1805 transitions. [2023-08-24 15:39:06,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 717 transitions, 8732 flow [2023-08-24 15:39:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 717 transitions, 8709 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 15:39:06,825 INFO L231 Difference]: Finished difference. Result has 212 places, 582 transitions, 7757 flow [2023-08-24 15:39:06,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4726, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7757, PETRI_PLACES=212, PETRI_TRANSITIONS=582} [2023-08-24 15:39:06,826 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2023-08-24 15:39:06,826 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 582 transitions, 7757 flow [2023-08-24 15:39:06,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 70.9090909090909) internal successors, (2340), 33 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:06,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:06,826 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] [2023-08-24 15:39:06,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-24 15:39:07,031 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,SelfDestructingSolverStorable11 [2023-08-24 15:39:07,032 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:07,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -622397099, now seen corresponding path program 9 times [2023-08-24 15:39:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145459052] [2023-08-24 15:39:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145459052] [2023-08-24 15:39:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145459052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320834531] [2023-08-24 15:39:07,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:39:07,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:07,375 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-24 15:39:07,377 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-24 15:39:07,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 15:39:07,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:07,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 15:39:07,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:07,792 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:07,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 71 [2023-08-24 15:39:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:08,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:08,108 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:08,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 45 [2023-08-24 15:39:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:08,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320834531] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:08,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:08,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-24 15:39:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655907849] [2023-08-24 15:39:08,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:08,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 15:39:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 15:39:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2023-08-24 15:39:08,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:39:08,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 582 transitions, 7757 flow. Second operand has 30 states, 30 states have (on average 81.03333333333333) internal successors, (2431), 30 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:08,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:08,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:39:08,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:10,765 INFO L124 PetriNetUnfolderBase]: 3485/5167 cut-off events. [2023-08-24 15:39:10,765 INFO L125 PetriNetUnfolderBase]: For 59993/59993 co-relation queries the response was YES. [2023-08-24 15:39:10,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36324 conditions, 5167 events. 3485/5167 cut-off events. For 59993/59993 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25843 event pairs, 377 based on Foata normal form. 3/5156 useless extension candidates. Maximal degree in co-relation 36246. Up to 4036 conditions per place. [2023-08-24 15:39:10,800 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 470 selfloop transitions, 306 changer transitions 12/788 dead transitions. [2023-08-24 15:39:10,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 788 transitions, 11310 flow [2023-08-24 15:39:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 15:39:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 15:39:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3261 transitions. [2023-08-24 15:39:10,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.306484962406015 [2023-08-24 15:39:10,804 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3261 transitions. [2023-08-24 15:39:10,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3261 transitions. [2023-08-24 15:39:10,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:10,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3261 transitions. [2023-08-24 15:39:10,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.8157894736842) internal successors, (3261), 38 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:10,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 280.0) internal successors, (10920), 39 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:10,814 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 280.0) internal successors, (10920), 39 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:10,814 INFO L175 Difference]: Start difference. First operand has 212 places, 582 transitions, 7757 flow. Second operand 38 states and 3261 transitions. [2023-08-24 15:39:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 788 transitions, 11310 flow [2023-08-24 15:39:11,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 788 transitions, 10650 flow, removed 268 selfloop flow, removed 9 redundant places. [2023-08-24 15:39:11,253 INFO L231 Difference]: Finished difference. Result has 250 places, 667 transitions, 9095 flow [2023-08-24 15:39:11,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=7111, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=9095, PETRI_PLACES=250, PETRI_TRANSITIONS=667} [2023-08-24 15:39:11,255 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2023-08-24 15:39:11,255 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 667 transitions, 9095 flow [2023-08-24 15:39:11,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 81.03333333333333) internal successors, (2431), 30 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:11,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:11,255 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] [2023-08-24 15:39:11,266 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-24 15:39:11,460 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,SelfDestructingSolverStorable12 [2023-08-24 15:39:11,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:11,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -349720797, now seen corresponding path program 10 times [2023-08-24 15:39:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043250882] [2023-08-24 15:39:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043250882] [2023-08-24 15:39:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043250882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465667319] [2023-08-24 15:39:11,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:39:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:11,994 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-24 15:39:12,021 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-24 15:39:12,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:39:12,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:12,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 15:39:12,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:12,410 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-24 15:39:12,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 63 [2023-08-24 15:39:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:12,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:12,640 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:12,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 45 [2023-08-24 15:39:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465667319] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:12,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 27 [2023-08-24 15:39:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645937494] [2023-08-24 15:39:12,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:39:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:39:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2023-08-24 15:39:12,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 280 [2023-08-24 15:39:12,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 667 transitions, 9095 flow. Second operand has 29 states, 29 states have (on average 71.13793103448276) internal successors, (2063), 29 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:12,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:12,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 280 [2023-08-24 15:39:12,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:14,829 INFO L124 PetriNetUnfolderBase]: 3810/5681 cut-off events. [2023-08-24 15:39:14,830 INFO L125 PetriNetUnfolderBase]: For 68114/68114 co-relation queries the response was YES. [2023-08-24 15:39:14,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40767 conditions, 5681 events. 3810/5681 cut-off events. For 68114/68114 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 29103 event pairs, 441 based on Foata normal form. 3/5652 useless extension candidates. Maximal degree in co-relation 40680. Up to 5003 conditions per place. [2023-08-24 15:39:14,877 INFO L140 encePairwiseOnDemand]: 265/280 looper letters, 548 selfloop transitions, 244 changer transitions 16/808 dead transitions. [2023-08-24 15:39:14,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 808 transitions, 12303 flow [2023-08-24 15:39:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 15:39:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 15:39:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1511 transitions. [2023-08-24 15:39:14,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26982142857142855 [2023-08-24 15:39:14,897 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1511 transitions. [2023-08-24 15:39:14,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1511 transitions. [2023-08-24 15:39:14,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:14,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1511 transitions. [2023-08-24 15:39:14,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 75.55) internal successors, (1511), 20 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:14,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 280.0) internal successors, (5880), 21 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:14,903 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 280.0) internal successors, (5880), 21 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:14,903 INFO L175 Difference]: Start difference. First operand has 250 places, 667 transitions, 9095 flow. Second operand 20 states and 1511 transitions. [2023-08-24 15:39:14,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 808 transitions, 12303 flow [2023-08-24 15:39:15,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 808 transitions, 11464 flow, removed 298 selfloop flow, removed 22 redundant places. [2023-08-24 15:39:15,220 INFO L231 Difference]: Finished difference. Result has 257 places, 751 transitions, 10297 flow [2023-08-24 15:39:15,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=8497, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=10297, PETRI_PLACES=257, PETRI_TRANSITIONS=751} [2023-08-24 15:39:15,222 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2023-08-24 15:39:15,222 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 751 transitions, 10297 flow [2023-08-24 15:39:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 71.13793103448276) internal successors, (2063), 29 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:15,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:15,226 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] [2023-08-24 15:39:15,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-24 15:39:15,432 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,SelfDestructingSolverStorable13 [2023-08-24 15:39:15,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:15,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1526685497, now seen corresponding path program 11 times [2023-08-24 15:39:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468900555] [2023-08-24 15:39:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468900555] [2023-08-24 15:39:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468900555] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101430578] [2023-08-24 15:39:15,803 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:39:15,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:15,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:15,804 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-24 15:39:15,806 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-24 15:39:15,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:15,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:15,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 15:39:15,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:16,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-08-24 15:39:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:16,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:16,284 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:16,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 45 [2023-08-24 15:39:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101430578] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 21 [2023-08-24 15:39:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576619561] [2023-08-24 15:39:16,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 15:39:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 15:39:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2023-08-24 15:39:16,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 280 [2023-08-24 15:39:16,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 751 transitions, 10297 flow. Second operand has 23 states, 23 states have (on average 81.6086956521739) internal successors, (1877), 23 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:16,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:16,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 280 [2023-08-24 15:39:16,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:18,148 INFO L124 PetriNetUnfolderBase]: 3614/5427 cut-off events. [2023-08-24 15:39:18,148 INFO L125 PetriNetUnfolderBase]: For 72018/72018 co-relation queries the response was YES. [2023-08-24 15:39:18,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40684 conditions, 5427 events. 3614/5427 cut-off events. For 72018/72018 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 28036 event pairs, 451 based on Foata normal form. 16/5411 useless extension candidates. Maximal degree in co-relation 40588. Up to 4423 conditions per place. [2023-08-24 15:39:18,189 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 512 selfloop transitions, 249 changer transitions 1/762 dead transitions. [2023-08-24 15:39:18,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 762 transitions, 12079 flow [2023-08-24 15:39:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 15:39:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 15:39:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1655 transitions. [2023-08-24 15:39:18,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31109022556390975 [2023-08-24 15:39:18,192 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1655 transitions. [2023-08-24 15:39:18,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1655 transitions. [2023-08-24 15:39:18,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:18,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1655 transitions. [2023-08-24 15:39:18,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 87.10526315789474) internal successors, (1655), 19 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:18,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 280.0) internal successors, (5600), 20 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:18,196 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 280.0) internal successors, (5600), 20 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:18,196 INFO L175 Difference]: Start difference. First operand has 257 places, 751 transitions, 10297 flow. Second operand 19 states and 1655 transitions. [2023-08-24 15:39:18,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 762 transitions, 12079 flow [2023-08-24 15:39:18,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 762 transitions, 11681 flow, removed 152 selfloop flow, removed 7 redundant places. [2023-08-24 15:39:18,438 INFO L231 Difference]: Finished difference. Result has 257 places, 692 transitions, 10069 flow [2023-08-24 15:39:18,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9152, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10069, PETRI_PLACES=257, PETRI_TRANSITIONS=692} [2023-08-24 15:39:18,438 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2023-08-24 15:39:18,439 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 692 transitions, 10069 flow [2023-08-24 15:39:18,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 81.6086956521739) internal successors, (1877), 23 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:18,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:18,439 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] [2023-08-24 15:39:18,444 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-24 15:39:18,644 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,SelfDestructingSolverStorable14 [2023-08-24 15:39:18,644 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:18,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1862569573, now seen corresponding path program 12 times [2023-08-24 15:39:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943361663] [2023-08-24 15:39:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943361663] [2023-08-24 15:39:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943361663] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715262429] [2023-08-24 15:39:19,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:39:19,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:19,063 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-24 15:39:19,064 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-24 15:39:19,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:39:19,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:19,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 15:39:19,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:19,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-08-24 15:39:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:19,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:19,583 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:19,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2023-08-24 15:39:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715262429] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:19,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2023-08-24 15:39:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838098468] [2023-08-24 15:39:19,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:19,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 15:39:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 15:39:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-08-24 15:39:19,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 280 [2023-08-24 15:39:19,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 692 transitions, 10069 flow. Second operand has 22 states, 22 states have (on average 85.5909090909091) internal successors, (1883), 22 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:19,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:19,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 280 [2023-08-24 15:39:19,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:21,039 INFO L124 PetriNetUnfolderBase]: 3575/5418 cut-off events. [2023-08-24 15:39:21,039 INFO L125 PetriNetUnfolderBase]: For 74560/74702 co-relation queries the response was YES. [2023-08-24 15:39:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41219 conditions, 5418 events. 3575/5418 cut-off events. For 74560/74702 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 29031 event pairs, 495 based on Foata normal form. 86/5434 useless extension candidates. Maximal degree in co-relation 41122. Up to 4872 conditions per place. [2023-08-24 15:39:21,184 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 590 selfloop transitions, 121 changer transitions 3/738 dead transitions. [2023-08-24 15:39:21,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 738 transitions, 11925 flow [2023-08-24 15:39:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 15:39:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 15:39:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 992 transitions. [2023-08-24 15:39:21,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3220779220779221 [2023-08-24 15:39:21,186 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 992 transitions. [2023-08-24 15:39:21,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 992 transitions. [2023-08-24 15:39:21,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:21,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 992 transitions. [2023-08-24 15:39:21,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.18181818181819) internal successors, (992), 11 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-24 15:39:21,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 280.0) internal successors, (3360), 12 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:21,193 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 280.0) internal successors, (3360), 12 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:21,193 INFO L175 Difference]: Start difference. First operand has 257 places, 692 transitions, 10069 flow. Second operand 11 states and 992 transitions. [2023-08-24 15:39:21,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 738 transitions, 11925 flow [2023-08-24 15:39:21,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 738 transitions, 11542 flow, removed 93 selfloop flow, removed 12 redundant places. [2023-08-24 15:39:21,432 INFO L231 Difference]: Finished difference. Result has 258 places, 709 transitions, 10278 flow [2023-08-24 15:39:21,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9705, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10278, PETRI_PLACES=258, PETRI_TRANSITIONS=709} [2023-08-24 15:39:21,432 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2023-08-24 15:39:21,433 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 709 transitions, 10278 flow [2023-08-24 15:39:21,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 85.5909090909091) internal successors, (1883), 22 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:21,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:21,433 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] [2023-08-24 15:39:21,438 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-24 15:39:21,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:21,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:21,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -478099671, now seen corresponding path program 13 times [2023-08-24 15:39:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:21,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124324162] [2023-08-24 15:39:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124324162] [2023-08-24 15:39:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124324162] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479134304] [2023-08-24 15:39:21,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:39:21,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:21,950 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-24 15:39:21,952 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-24 15:39:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:22,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 15:39:22,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:22,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-08-24 15:39:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:22,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:22,463 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:22,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 45 [2023-08-24 15:39:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479134304] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:22,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-24 15:39:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095512882] [2023-08-24 15:39:22,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 15:39:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 15:39:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-08-24 15:39:22,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 280 [2023-08-24 15:39:22,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 709 transitions, 10278 flow. Second operand has 22 states, 22 states have (on average 85.68181818181819) internal successors, (1885), 22 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:22,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:22,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 280 [2023-08-24 15:39:22,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:23,921 INFO L124 PetriNetUnfolderBase]: 3581/5436 cut-off events. [2023-08-24 15:39:23,921 INFO L125 PetriNetUnfolderBase]: For 73405/73561 co-relation queries the response was YES. [2023-08-24 15:39:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41260 conditions, 5436 events. 3581/5436 cut-off events. For 73405/73561 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 29270 event pairs, 486 based on Foata normal form. 98/5464 useless extension candidates. Maximal degree in co-relation 41159. Up to 4526 conditions per place. [2023-08-24 15:39:23,961 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 535 selfloop transitions, 187 changer transitions 1/747 dead transitions. [2023-08-24 15:39:23,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 747 transitions, 12025 flow [2023-08-24 15:39:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 15:39:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 15:39:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1088 transitions. [2023-08-24 15:39:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2023-08-24 15:39:23,963 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1088 transitions. [2023-08-24 15:39:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1088 transitions. [2023-08-24 15:39:23,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:23,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1088 transitions. [2023-08-24 15:39:23,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.66666666666667) internal successors, (1088), 12 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:23,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 280.0) internal successors, (3640), 13 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:23,966 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 280.0) internal successors, (3640), 13 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:23,966 INFO L175 Difference]: Start difference. First operand has 258 places, 709 transitions, 10278 flow. Second operand 12 states and 1088 transitions. [2023-08-24 15:39:23,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 747 transitions, 12025 flow [2023-08-24 15:39:24,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 747 transitions, 11761 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-24 15:39:24,275 INFO L231 Difference]: Finished difference. Result has 263 places, 714 transitions, 10568 flow [2023-08-24 15:39:24,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=10002, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10568, PETRI_PLACES=263, PETRI_TRANSITIONS=714} [2023-08-24 15:39:24,276 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2023-08-24 15:39:24,276 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 714 transitions, 10568 flow [2023-08-24 15:39:24,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 85.68181818181819) internal successors, (1885), 22 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:24,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:24,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:24,283 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-24 15:39:24,480 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,SelfDestructingSolverStorable16 [2023-08-24 15:39:24,481 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:24,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash 778742200, now seen corresponding path program 14 times [2023-08-24 15:39:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207714607] [2023-08-24 15:39:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207714607] [2023-08-24 15:39:24,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207714607] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:24,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471980805] [2023-08-24 15:39:24,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:39:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:24,575 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-24 15:39:24,577 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-24 15:39:24,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:24,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:24,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:24,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:24,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471980805] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:24,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-24 15:39:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484748341] [2023-08-24 15:39:24,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 15:39:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 15:39:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 15:39:24,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 280 [2023-08-24 15:39:24,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 714 transitions, 10568 flow. Second operand has 15 states, 15 states have (on average 108.8) internal successors, (1632), 15 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:24,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:24,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 280 [2023-08-24 15:39:24,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:25,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([540] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_90| v_~A~0.base_47) (+ v_~A~0.offset_47 (* v_thread2Thread1of1ForFork0_~i~1_38 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (= v_~max2~0_58 v_~max2~0_57) (= |v_thread2Thread1of1ForFork0_#t~mem6_12| |v_thread2Thread1of1ForFork0_#t~mem6_11|) (<= .cse0 v_~max2~0_58)))) (= v_thread2Thread1of1ForFork0_~i~1_37 (+ v_thread2Thread1of1ForFork0_~i~1_38 1)) (< v_thread2Thread1of1ForFork0_~i~1_38 v_~M~0_27)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_38, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork0_#t~mem6=|v_thread2Thread1of1ForFork0_#t~mem6_12|, ~A~0.offset=v_~A~0.offset_47, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_58, #memory_int=|v_#memory_int_90|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_37, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_15|, thread2Thread1of1ForFork0_#t~mem6=|v_thread2Thread1of1ForFork0_#t~mem6_11|, ~A~0.offset=v_~A~0.offset_47, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_57, #memory_int=|v_#memory_int_90|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post4, thread2Thread1of1ForFork0_#t~mem6, ~max2~0, thread2Thread1of1ForFork0_#t~mem5][130], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), 1262#true, Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), 98#L95-2true, Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), 103#L58-4true, Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2010#true, Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,572 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:39:25,572 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:39:25,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L58-4-->thread2EXIT: Formula: (and (<= v_~M~0_25 v_thread2Thread1of1ForFork0_~i~1_34) (= |v_thread2Thread1of1ForFork0_#res.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_34, ~M~0=v_~M~0_25} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_7|, ~M~0=v_~M~0_25, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#res.base][425], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1262#true, Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, 48#thread2EXITtrue, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), 98#L95-2true, Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 2010#true, 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,645 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,645 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,646 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,646 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_114| v_~A~0.base_55) (+ (* v_thread3Thread1of1ForFork1_~i~2_34 4) v_~A~0.offset_55)))) (or (and (= |v_thread3Thread1of1ForFork1_#t~mem9_16| |v_thread3Thread1of1ForFork1_#t~mem9_15|) (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64)) (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)))) (< v_thread3Thread1of1ForFork1_~i~2_34 v_~N~0_43) (= (+ v_thread3Thread1of1ForFork1_~i~2_34 1) v_thread3Thread1of1ForFork1_~i~2_33)) InVars {~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_114|, thread3Thread1of1ForFork1_#t~mem9=|v_thread3Thread1of1ForFork1_#t~mem9_16|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_34, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_114|, thread3Thread1of1ForFork1_#t~mem9=|v_thread3Thread1of1ForFork1_#t~mem9_15|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_33, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_9|, thread3Thread1of1ForFork1_#t~post7=|v_thread3Thread1of1ForFork1_#t~post7_17|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork1_#t~mem9, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_#t~post7][427], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1262#true, Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), 307#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), 98#L95-2true, 103#L58-4true, Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 2010#true, Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,647 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,647 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,647 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,647 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-24 15:39:25,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L58-4-->thread2EXIT: Formula: (and (<= v_~M~0_25 v_thread2Thread1of1ForFork0_~i~1_34) (= |v_thread2Thread1of1ForFork0_#res.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_34, ~M~0=v_~M~0_25} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_7|, ~M~0=v_~M~0_25, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#res.base][425], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), 1262#true, Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, 48#thread2EXITtrue, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, 69#L96-1true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 2010#true, 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,657 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([540] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_90| v_~A~0.base_47) (+ v_~A~0.offset_47 (* v_thread2Thread1of1ForFork0_~i~1_38 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (= v_~max2~0_58 v_~max2~0_57) (= |v_thread2Thread1of1ForFork0_#t~mem6_12| |v_thread2Thread1of1ForFork0_#t~mem6_11|) (<= .cse0 v_~max2~0_58)))) (= v_thread2Thread1of1ForFork0_~i~1_37 (+ v_thread2Thread1of1ForFork0_~i~1_38 1)) (< v_thread2Thread1of1ForFork0_~i~1_38 v_~M~0_27)) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_38, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork0_#t~mem6=|v_thread2Thread1of1ForFork0_#t~mem6_12|, ~A~0.offset=v_~A~0.offset_47, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_58, #memory_int=|v_#memory_int_90|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_37, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_15|, thread2Thread1of1ForFork0_#t~mem6=|v_thread2Thread1of1ForFork0_#t~mem6_11|, ~A~0.offset=v_~A~0.offset_47, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_57, #memory_int=|v_#memory_int_90|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post4, thread2Thread1of1ForFork0_#t~mem6, ~max2~0, thread2Thread1of1ForFork0_#t~mem5][130], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1262#true, Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, 69#L96-1true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), 103#L58-4true, Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2010#true, Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,658 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([552] L70-4-->L70-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_114| v_~A~0.base_55) (+ (* v_thread3Thread1of1ForFork1_~i~2_34 4) v_~A~0.offset_55)))) (or (and (= |v_thread3Thread1of1ForFork1_#t~mem9_16| |v_thread3Thread1of1ForFork1_#t~mem9_15|) (= v_~max2~0_64 v_~max2~0_63) (<= .cse0 v_~max2~0_64)) (and (= v_~max2~0_63 .cse0) (< v_~max2~0_64 .cse0)))) (< v_thread3Thread1of1ForFork1_~i~2_34 v_~N~0_43) (= (+ v_thread3Thread1of1ForFork1_~i~2_34 1) v_thread3Thread1of1ForFork1_~i~2_33)) InVars {~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_64, #memory_int=|v_#memory_int_114|, thread3Thread1of1ForFork1_#t~mem9=|v_thread3Thread1of1ForFork1_#t~mem9_16|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_34, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_63, #memory_int=|v_#memory_int_114|, thread3Thread1of1ForFork1_#t~mem9=|v_thread3Thread1of1ForFork1_#t~mem9_15|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_33, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_9|, thread3Thread1of1ForFork1_#t~post7=|v_thread3Thread1of1ForFork1_#t~post7_17|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork1_#t~mem9, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_#t~post7][427], [Black: 466#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2413#(and (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 630#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2427#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 463#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 0)) (= ~max2~0 0) (<= ~M~0 0) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2419#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), Black: 2789#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 2949#true, Black: 626#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2421#(and (= ~A~0.offset 0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4))) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_84 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_84 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_84 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_84 1)))) (= ~max2~0 0))) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2944#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 628#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2831#(and (or (and (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)) 0) (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99))) (= ~max2~0 0)) (exists ((v_thread3Thread1of1ForFork1_~i~2_99 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_99 0) (<= 0 v_thread3Thread1of1ForFork1_~i~2_99) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_99 4)))))) (= ~A~0.offset 0) (= ~max1~0 0)), Black: 2360#(or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), Black: 467#(= ~max2~0 ~max1~0), Black: 2352#(or (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), Black: 2423#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))))), 1262#true, Black: 624#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (< ~N~0 1)) (< ~N~0 2))) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2429#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< thread3Thread1of1ForFork1_~i~2 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0))), Black: 502#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~max2~0 0) (<= ~M~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 636#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (forall ((v_ArrVal_173 (Array Int Int))) (or (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (= ~max1~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~max2~0 ~max1~0) (or (= ~max1~0 0) (< 0 ~max1~0)) (= ~M~0 0)), Black: 2252#(= ~max2~0 ~max1~0), Black: 618#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1704#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1649#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 455#true, Black: 154#(and (= ~max2~0 ~max1~0) (or (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| (* 1073741824 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824))))), 2441#true, Black: 1051#(and (or (and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0)) (< 0 ~max2~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 1053#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1041#(and (= ~A~0.offset 0) (or (< 0 (+ ~M~0 1)) (and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))) (<= 1 ~N~0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 885#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 1640#true, Black: 1322#(and (= ~A~0.offset 0) (= ~max2~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1436#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1442#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)))), Black: 1275#(= ~max2~0 ~max1~0), Black: 1335#(and (<= ~N~0 1) (or (and (= ~max2~0 0) (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max1~0 0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), 1061#true, Black: 2217#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2611#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 2193#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2450#(and (= ~A~0.offset 0) (= ~max1~0 0) (or (and (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 0)))), Black: 2219#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), Black: 2067#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 309#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 311#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 2203#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (<= ~N~0 1) (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (= ~max2~0 0) (< 0 ~max1~0)) (and (= ~max2~0 ~max1~0) (< 0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0) (or (= ~max1~0 0) (< 0 ~max1~0))) (and (= ~max2~0 0) (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (< 0 ~N~0)), Black: 2221#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), Black: 2227#(and (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< (+ ~M~0 1) ~N~0) (= ~M~0 0)) (< 0 ~N~0)), Black: 2071#(and (= ~A~0.offset 0) (or (and (= ~max2~0 0) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) 0)))) (exists ((v_thread3Thread1of1ForFork1_~i~2_79 Int)) (and (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4))) (<= v_thread3Thread1of1ForFork1_~i~2_79 0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_79 1)) (= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_79 4)) ~max2~0)))) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 2223#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (< 0 ~N~0)), 307#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~N~0)), Black: 452#(and (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)), 131#L70-4true, 2781#true, 69#L96-1true, Black: 1875#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0))))), Black: 1997#(and (<= thread3Thread1of1ForFork1_~i~2 (+ ~M~0 1)) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (or (and (or (= ~max2~0 0) (and (< 0 ~max2~0) (not (= ~M~0 0)))) (= ~max1~0 0)) (and (< 0 ~max1~0) (or (and (not (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))) (= ~max2~0 ~max1~0)))) (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (<= thread3Thread1of1ForFork1_~i~2 0))), Black: 1917#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 1989#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1840#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1883#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 1987#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= thread2Thread1of1ForFork0_~i~1 0) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1985#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~N~0) (= ~max2~0 0) (<= ~N~0 1) (or (and (< 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 0)))), Black: 1879#(and (or (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max2~0 0) (< 0 ~max2~0)))) (< 0 ~max1~0)) (and (or (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max2~0)) (and (= ~max2~0 0) (<= thread3Thread1of1ForFork1_~i~2 1))) (= ~max1~0 0))) (<= 1 ~N~0)), Black: 2776#(and (= ~A~0.offset 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (or (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (< 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4))))) (and (exists ((v_thread3Thread1of1ForFork1_~i~2_94 Int)) (and (< v_thread3Thread1of1ForFork1_~i~2_94 ~N~0) (<= thread3Thread1of1ForFork1_~i~2 (+ v_thread3Thread1of1ForFork1_~i~2_94 1)) (<= (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork1_~i~2_94 4)) 0))) (= ~max2~0 0))) (= thread1Thread1of1ForFork2_~i~0 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (and (<= (+ ~M~0 1) 0) (<= thread3Thread1of1ForFork1_~i~2 (+ ~N~0 ~M~0))))), 103#L58-4true, Black: 2676#(or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 2625#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0)) (= ~max1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 839#(and (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= thread3Thread1of1ForFork1_~i~2 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2239#true, Black: 819#(and (= ~A~0.offset 0) (<= thread2Thread1of1ForFork0_~i~1 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 660#(or (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), Black: 661#(= ~max2~0 ~max1~0), Black: 1229#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1233#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (and (= ~max2~0 ~max1~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), 1807#true, Black: 1072#(= ~max2~0 ~max1~0), 650#true, Black: 1227#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~M~0 0) (= thread1Thread1of1ForFork2_~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 857#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (or (and (= ~max2~0 ~max1~0) (< 0 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (< 0 ~N~0)), Black: 1174#(or (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (and (or (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), Black: 821#(and (or (< thread2Thread1of1ForFork0_~i~1 1) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~N~0)) (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)) (= ~max2~0 0) (= ~max1~0 0) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1235#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (or (< ~M~0 thread1Thread1of1ForFork2_~i~0) (and (= ~M~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 thread1Thread1of1ForFork2_~i~0)) (or (and (= ~max2~0 0) (or (and (= ~max1~0 0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (< 0 ~max1~0)))) (and (or (and (= ~max2~0 ~max1~0) (<= thread3Thread1of1ForFork1_~i~2 1)) (and (<= thread3Thread1of1ForFork1_~i~2 0) (or (= ~max1~0 0) (< 0 ~max1~0)))) (< 0 ~max2~0))) (< 0 ~N~0)), Black: 1190#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1))), Black: 1225#(and (or (< 0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0)) (< 0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread2Thread1of1ForFork0_~i~1 (+ thread1Thread1of1ForFork2_~i~0 1)) (or (< thread2Thread1of1ForFork0_~i~1 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0))), 2010#true, Black: 2409#(and (or (< thread3Thread1of1ForFork1_~i~2 1) (and (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (= ~A~0.offset 0) (or (and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max2~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max2~0 0))) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (= ~max1~0 0)), 875#true]) [2023-08-24 15:39:25,658 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,658 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:39:25,809 INFO L124 PetriNetUnfolderBase]: 3696/5486 cut-off events. [2023-08-24 15:39:25,809 INFO L125 PetriNetUnfolderBase]: For 93402/93922 co-relation queries the response was YES. [2023-08-24 15:39:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44145 conditions, 5486 events. 3696/5486 cut-off events. For 93402/93922 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 29386 event pairs, 759 based on Foata normal form. 294/5463 useless extension candidates. Maximal degree in co-relation 44045. Up to 3636 conditions per place. [2023-08-24 15:39:25,852 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 678 selfloop transitions, 77 changer transitions 0/807 dead transitions. [2023-08-24 15:39:25,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 807 transitions, 13124 flow [2023-08-24 15:39:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 15:39:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 15:39:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 913 transitions. [2023-08-24 15:39:25,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075892857142857 [2023-08-24 15:39:25,853 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 913 transitions. [2023-08-24 15:39:25,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 913 transitions. [2023-08-24 15:39:25,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:25,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 913 transitions. [2023-08-24 15:39:25,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:25,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:25,855 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:25,856 INFO L175 Difference]: Start difference. First operand has 263 places, 714 transitions, 10568 flow. Second operand 8 states and 913 transitions. [2023-08-24 15:39:25,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 807 transitions, 13124 flow [2023-08-24 15:39:26,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 807 transitions, 12702 flow, removed 97 selfloop flow, removed 10 redundant places. [2023-08-24 15:39:26,131 INFO L231 Difference]: Finished difference. Result has 262 places, 694 transitions, 10256 flow [2023-08-24 15:39:26,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9819, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10256, PETRI_PLACES=262, PETRI_TRANSITIONS=694} [2023-08-24 15:39:26,131 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2023-08-24 15:39:26,131 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 694 transitions, 10256 flow [2023-08-24 15:39:26,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 108.8) internal successors, (1632), 15 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:26,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:26,132 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:26,136 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-24 15:39:26,336 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,SelfDestructingSolverStorable17 [2023-08-24 15:39:26,336 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:26,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1793119633, now seen corresponding path program 15 times [2023-08-24 15:39:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545990042] [2023-08-24 15:39:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545990042] [2023-08-24 15:39:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545990042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606825996] [2023-08-24 15:39:26,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:39:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:26,437 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-24 15:39:26,439 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-24 15:39:26,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:39:26,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:26,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:26,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:26,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606825996] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:26,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-24 15:39:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345438539] [2023-08-24 15:39:26,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 15:39:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 15:39:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-24 15:39:26,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 280 [2023-08-24 15:39:26,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 694 transitions, 10256 flow. Second operand has 14 states, 14 states have (on average 108.57142857142857) internal successors, (1520), 14 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:26,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:26,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 280 [2023-08-24 15:39:26,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:27,652 INFO L124 PetriNetUnfolderBase]: 3022/4647 cut-off events. [2023-08-24 15:39:27,653 INFO L125 PetriNetUnfolderBase]: For 88792/89181 co-relation queries the response was YES. [2023-08-24 15:39:27,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37716 conditions, 4647 events. 3022/4647 cut-off events. For 88792/89181 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 25967 event pairs, 532 based on Foata normal form. 464/4862 useless extension candidates. Maximal degree in co-relation 37616. Up to 2005 conditions per place. [2023-08-24 15:39:27,703 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 566 selfloop transitions, 63 changer transitions 23/704 dead transitions. [2023-08-24 15:39:27,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 704 transitions, 11442 flow [2023-08-24 15:39:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 15:39:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 15:39:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-08-24 15:39:27,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2023-08-24 15:39:27,704 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-08-24 15:39:27,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-08-24 15:39:27,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:27,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-08-24 15:39:27,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:27,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:27,707 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:27,707 INFO L175 Difference]: Start difference. First operand has 262 places, 694 transitions, 10256 flow. Second operand 7 states and 805 transitions. [2023-08-24 15:39:27,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 704 transitions, 11442 flow [2023-08-24 15:39:28,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 704 transitions, 11156 flow, removed 65 selfloop flow, removed 12 redundant places. [2023-08-24 15:39:28,054 INFO L231 Difference]: Finished difference. Result has 257 places, 581 transitions, 8529 flow [2023-08-24 15:39:28,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=8562, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8529, PETRI_PLACES=257, PETRI_TRANSITIONS=581} [2023-08-24 15:39:28,055 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2023-08-24 15:39:28,055 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 581 transitions, 8529 flow [2023-08-24 15:39:28,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.57142857142857) internal successors, (1520), 14 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:28,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:28,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:28,062 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-24 15:39:28,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:28,260 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:28,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1911803685, now seen corresponding path program 16 times [2023-08-24 15:39:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568817734] [2023-08-24 15:39:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568817734] [2023-08-24 15:39:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568817734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144700081] [2023-08-24 15:39:28,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:39:28,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:28,393 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-24 15:39:28,404 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-24 15:39:28,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:39:28,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:28,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 15:39:28,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:28,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144700081] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:28,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2023-08-24 15:39:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966689350] [2023-08-24 15:39:28,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:28,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 15:39:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 15:39:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-08-24 15:39:28,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:28,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 581 transitions, 8529 flow. Second operand has 16 states, 16 states have (on average 101.0625) internal successors, (1617), 16 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:28,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:28,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:28,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:29,623 INFO L124 PetriNetUnfolderBase]: 2734/4338 cut-off events. [2023-08-24 15:39:29,623 INFO L125 PetriNetUnfolderBase]: For 73153/73285 co-relation queries the response was YES. [2023-08-24 15:39:29,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34637 conditions, 4338 events. 2734/4338 cut-off events. For 73153/73285 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 24574 event pairs, 279 based on Foata normal form. 298/4601 useless extension candidates. Maximal degree in co-relation 34543. Up to 1704 conditions per place. [2023-08-24 15:39:29,661 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 403 selfloop transitions, 205 changer transitions 101/731 dead transitions. [2023-08-24 15:39:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 731 transitions, 11748 flow [2023-08-24 15:39:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 15:39:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 15:39:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1690 transitions. [2023-08-24 15:39:29,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37723214285714285 [2023-08-24 15:39:29,663 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1690 transitions. [2023-08-24 15:39:29,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1690 transitions. [2023-08-24 15:39:29,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:29,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1690 transitions. [2023-08-24 15:39:29,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 105.625) internal successors, (1690), 16 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:29,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 280.0) internal successors, (4760), 17 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:29,667 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 280.0) internal successors, (4760), 17 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:29,667 INFO L175 Difference]: Start difference. First operand has 257 places, 581 transitions, 8529 flow. Second operand 16 states and 1690 transitions. [2023-08-24 15:39:29,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 731 transitions, 11748 flow [2023-08-24 15:39:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 731 transitions, 11450 flow, removed 51 selfloop flow, removed 10 redundant places. [2023-08-24 15:39:29,987 INFO L231 Difference]: Finished difference. Result has 267 places, 495 transitions, 7392 flow [2023-08-24 15:39:29,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=7925, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7392, PETRI_PLACES=267, PETRI_TRANSITIONS=495} [2023-08-24 15:39:29,988 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2023-08-24 15:39:29,988 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 495 transitions, 7392 flow [2023-08-24 15:39:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 101.0625) internal successors, (1617), 16 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:29,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:29,989 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] [2023-08-24 15:39:29,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-24 15:39:30,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:30,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:30,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash -115189955, now seen corresponding path program 1 times [2023-08-24 15:39:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568394174] [2023-08-24 15:39:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568394174] [2023-08-24 15:39:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568394174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490092754] [2023-08-24 15:39:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:30,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:30,305 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:30,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 15:39:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:30,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 15:39:30,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:30,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490092754] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:30,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:30,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-08-24 15:39:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489112918] [2023-08-24 15:39:30,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:30,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 15:39:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:30,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 15:39:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-08-24 15:39:30,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:30,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 495 transitions, 7392 flow. Second operand has 16 states, 16 states have (on average 100.4375) internal successors, (1607), 16 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:30,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:30,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:31,402 INFO L124 PetriNetUnfolderBase]: 2423/3842 cut-off events. [2023-08-24 15:39:31,402 INFO L125 PetriNetUnfolderBase]: For 72488/72538 co-relation queries the response was YES. [2023-08-24 15:39:31,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31808 conditions, 3842 events. 2423/3842 cut-off events. For 72488/72538 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20965 event pairs, 509 based on Foata normal form. 35/3859 useless extension candidates. Maximal degree in co-relation 31713. Up to 1641 conditions per place. [2023-08-24 15:39:31,436 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 454 selfloop transitions, 80 changer transitions 36/587 dead transitions. [2023-08-24 15:39:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 587 transitions, 9733 flow [2023-08-24 15:39:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1075 transitions. [2023-08-24 15:39:31,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2023-08-24 15:39:31,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1075 transitions. [2023-08-24 15:39:31,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1075 transitions. [2023-08-24 15:39:31,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:31,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1075 transitions. [2023-08-24 15:39:31,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,442 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,442 INFO L175 Difference]: Start difference. First operand has 267 places, 495 transitions, 7392 flow. Second operand 10 states and 1075 transitions. [2023-08-24 15:39:31,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 587 transitions, 9733 flow [2023-08-24 15:39:31,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 587 transitions, 8819 flow, removed 195 selfloop flow, removed 22 redundant places. [2023-08-24 15:39:31,741 INFO L231 Difference]: Finished difference. Result has 255 places, 487 transitions, 6927 flow [2023-08-24 15:39:31,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=6692, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6927, PETRI_PLACES=255, PETRI_TRANSITIONS=487} [2023-08-24 15:39:31,741 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2023-08-24 15:39:31,741 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 487 transitions, 6927 flow [2023-08-24 15:39:31,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 100.4375) internal successors, (1607), 16 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:31,742 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] [2023-08-24 15:39:31,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:31,946 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:31,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1107490169, now seen corresponding path program 2 times [2023-08-24 15:39:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315797039] [2023-08-24 15:39:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315797039] [2023-08-24 15:39:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315797039] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291386651] [2023-08-24 15:39:32,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:39:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:32,033 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:32,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 15:39:32,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:32,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:32,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 15:39:32,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:32,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291386651] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:32,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 15:39:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755629732] [2023-08-24 15:39:32,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 15:39:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 15:39:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-08-24 15:39:32,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:32,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 487 transitions, 6927 flow. Second operand has 17 states, 17 states have (on average 100.11764705882354) internal successors, (1702), 17 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:32,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:32,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:32,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:33,017 INFO L124 PetriNetUnfolderBase]: 2266/3559 cut-off events. [2023-08-24 15:39:33,017 INFO L125 PetriNetUnfolderBase]: For 58566/58619 co-relation queries the response was YES. [2023-08-24 15:39:33,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28978 conditions, 3559 events. 2266/3559 cut-off events. For 58566/58619 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19115 event pairs, 427 based on Foata normal form. 50/3581 useless extension candidates. Maximal degree in co-relation 28881. Up to 1641 conditions per place. [2023-08-24 15:39:33,050 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 462 selfloop transitions, 109 changer transitions 26/614 dead transitions. [2023-08-24 15:39:33,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 614 transitions, 9852 flow [2023-08-24 15:39:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2023-08-24 15:39:33,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38285714285714284 [2023-08-24 15:39:33,052 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1072 transitions. [2023-08-24 15:39:33,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1072 transitions. [2023-08-24 15:39:33,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:33,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1072 transitions. [2023-08-24 15:39:33,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.2) internal successors, (1072), 10 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:33,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:33,055 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:33,055 INFO L175 Difference]: Start difference. First operand has 255 places, 487 transitions, 6927 flow. Second operand 10 states and 1072 transitions. [2023-08-24 15:39:33,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 614 transitions, 9852 flow [2023-08-24 15:39:33,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 614 transitions, 9554 flow, removed 111 selfloop flow, removed 10 redundant places. [2023-08-24 15:39:33,304 INFO L231 Difference]: Finished difference. Result has 255 places, 500 transitions, 7280 flow [2023-08-24 15:39:33,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=6669, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7280, PETRI_PLACES=255, PETRI_TRANSITIONS=500} [2023-08-24 15:39:33,304 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2023-08-24 15:39:33,305 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 500 transitions, 7280 flow [2023-08-24 15:39:33,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 100.11764705882354) internal successors, (1702), 17 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:33,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:33,305 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] [2023-08-24 15:39:33,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:33,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-24 15:39:33,509 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:33,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -101770271, now seen corresponding path program 3 times [2023-08-24 15:39:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003351310] [2023-08-24 15:39:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003351310] [2023-08-24 15:39:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003351310] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325170944] [2023-08-24 15:39:33,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:39:33,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:33,592 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:33,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 15:39:33,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:39:33,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:33,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 15:39:33,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:33,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325170944] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:33,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-24 15:39:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201622287] [2023-08-24 15:39:33,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:33,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 15:39:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 15:39:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-08-24 15:39:33,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:33,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 500 transitions, 7280 flow. Second operand has 18 states, 18 states have (on average 100.05555555555556) internal successors, (1801), 18 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:33,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:33,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:34,481 INFO L124 PetriNetUnfolderBase]: 2080/3383 cut-off events. [2023-08-24 15:39:34,482 INFO L125 PetriNetUnfolderBase]: For 52961/53018 co-relation queries the response was YES. [2023-08-24 15:39:34,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26950 conditions, 3383 events. 2080/3383 cut-off events. For 52961/53018 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 19281 event pairs, 425 based on Foata normal form. 154/3509 useless extension candidates. Maximal degree in co-relation 26856. Up to 1641 conditions per place. [2023-08-24 15:39:34,507 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 407 selfloop transitions, 59 changer transitions 86/568 dead transitions. [2023-08-24 15:39:34,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 568 transitions, 9128 flow [2023-08-24 15:39:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1065 transitions. [2023-08-24 15:39:34,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38035714285714284 [2023-08-24 15:39:34,509 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1065 transitions. [2023-08-24 15:39:34,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1065 transitions. [2023-08-24 15:39:34,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:34,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1065 transitions. [2023-08-24 15:39:34,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.5) internal successors, (1065), 10 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:34,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:34,511 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:34,511 INFO L175 Difference]: Start difference. First operand has 255 places, 500 transitions, 7280 flow. Second operand 10 states and 1065 transitions. [2023-08-24 15:39:34,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 568 transitions, 9128 flow [2023-08-24 15:39:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 568 transitions, 8922 flow, removed 33 selfloop flow, removed 11 redundant places. [2023-08-24 15:39:34,704 INFO L231 Difference]: Finished difference. Result has 252 places, 431 transitions, 5983 flow [2023-08-24 15:39:34,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=6722, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5983, PETRI_PLACES=252, PETRI_TRANSITIONS=431} [2023-08-24 15:39:34,704 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2023-08-24 15:39:34,704 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 431 transitions, 5983 flow [2023-08-24 15:39:34,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 100.05555555555556) internal successors, (1801), 18 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:34,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:34,705 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] [2023-08-24 15:39:34,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-24 15:39:34,909 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:34,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -838896169, now seen corresponding path program 4 times [2023-08-24 15:39:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158260888] [2023-08-24 15:39:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158260888] [2023-08-24 15:39:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158260888] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173146964] [2023-08-24 15:39:34,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:39:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:34,992 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:34,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 15:39:35,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:39:35,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:35,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 15:39:35,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:35,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173146964] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:35,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2023-08-24 15:39:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020962742] [2023-08-24 15:39:35,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:35,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 15:39:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 15:39:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-08-24 15:39:35,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 280 [2023-08-24 15:39:35,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 431 transitions, 5983 flow. Second operand has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 14 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:35,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:35,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 280 [2023-08-24 15:39:35,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:35,856 INFO L124 PetriNetUnfolderBase]: 1582/2558 cut-off events. [2023-08-24 15:39:35,856 INFO L125 PetriNetUnfolderBase]: For 39088/39088 co-relation queries the response was YES. [2023-08-24 15:39:35,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20084 conditions, 2558 events. 1582/2558 cut-off events. For 39088/39088 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13360 event pairs, 192 based on Foata normal form. 182/2726 useless extension candidates. Maximal degree in co-relation 19994. Up to 1028 conditions per place. [2023-08-24 15:39:35,878 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 258 selfloop transitions, 75 changer transitions 157/490 dead transitions. [2023-08-24 15:39:35,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 490 transitions, 7376 flow [2023-08-24 15:39:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 15:39:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 15:39:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1815 transitions. [2023-08-24 15:39:35,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2023-08-24 15:39:35,892 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1815 transitions. [2023-08-24 15:39:35,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1815 transitions. [2023-08-24 15:39:35,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:35,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1815 transitions. [2023-08-24 15:39:35,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 100.83333333333333) internal successors, (1815), 18 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:35,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 280.0) internal successors, (5320), 19 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:35,896 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 280.0) internal successors, (5320), 19 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:35,896 INFO L175 Difference]: Start difference. First operand has 252 places, 431 transitions, 5983 flow. Second operand 18 states and 1815 transitions. [2023-08-24 15:39:35,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 490 transitions, 7376 flow [2023-08-24 15:39:36,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 490 transitions, 6889 flow, removed 110 selfloop flow, removed 21 redundant places. [2023-08-24 15:39:36,032 INFO L231 Difference]: Finished difference. Result has 238 places, 281 transitions, 3319 flow [2023-08-24 15:39:36,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4611, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3319, PETRI_PLACES=238, PETRI_TRANSITIONS=281} [2023-08-24 15:39:36,032 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2023-08-24 15:39:36,032 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 281 transitions, 3319 flow [2023-08-24 15:39:36,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 14 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:36,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:36,033 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:36,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:36,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:36,237 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:36,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1505414074, now seen corresponding path program 17 times [2023-08-24 15:39:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819459795] [2023-08-24 15:39:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819459795] [2023-08-24 15:39:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819459795] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001405799] [2023-08-24 15:39:36,342 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:39:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:36,343 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:36,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-24 15:39:36,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:36,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:36,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:36,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:36,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001405799] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:36,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:36,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-08-24 15:39:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971754467] [2023-08-24 15:39:36,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:36,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 15:39:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 15:39:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2023-08-24 15:39:36,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 280 [2023-08-24 15:39:36,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 281 transitions, 3319 flow. Second operand has 23 states, 23 states have (on average 96.17391304347827) internal successors, (2212), 23 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:36,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:36,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 280 [2023-08-24 15:39:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:39,017 INFO L124 PetriNetUnfolderBase]: 2798/4006 cut-off events. [2023-08-24 15:39:39,017 INFO L125 PetriNetUnfolderBase]: For 80178/80178 co-relation queries the response was YES. [2023-08-24 15:39:39,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36631 conditions, 4006 events. 2798/4006 cut-off events. For 80178/80178 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17644 event pairs, 200 based on Foata normal form. 46/4032 useless extension candidates. Maximal degree in co-relation 36565. Up to 2202 conditions per place. [2023-08-24 15:39:39,047 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 515 selfloop transitions, 418 changer transitions 0/933 dead transitions. [2023-08-24 15:39:39,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 933 transitions, 14374 flow [2023-08-24 15:39:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-24 15:39:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-24 15:39:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 7075 transitions. [2023-08-24 15:39:39,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36096938775510207 [2023-08-24 15:39:39,053 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 7075 transitions. [2023-08-24 15:39:39,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 7075 transitions. [2023-08-24 15:39:39,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:39,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 7075 transitions. [2023-08-24 15:39:39,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 101.07142857142857) internal successors, (7075), 70 states have internal predecessors, (7075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:39,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 280.0) internal successors, (19880), 71 states have internal predecessors, (19880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:39,068 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 280.0) internal successors, (19880), 71 states have internal predecessors, (19880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:39,068 INFO L175 Difference]: Start difference. First operand has 238 places, 281 transitions, 3319 flow. Second operand 70 states and 7075 transitions. [2023-08-24 15:39:39,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 933 transitions, 14374 flow [2023-08-24 15:39:39,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 933 transitions, 12393 flow, removed 682 selfloop flow, removed 24 redundant places. [2023-08-24 15:39:39,313 INFO L231 Difference]: Finished difference. Result has 263 places, 594 transitions, 9256 flow [2023-08-24 15:39:39,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=9256, PETRI_PLACES=263, PETRI_TRANSITIONS=594} [2023-08-24 15:39:39,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2023-08-24 15:39:39,314 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 594 transitions, 9256 flow [2023-08-24 15:39:39,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.17391304347827) internal successors, (2212), 23 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:39,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:39,314 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:39,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-24 15:39:39,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:39,519 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:39,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1766244718, now seen corresponding path program 18 times [2023-08-24 15:39:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131902213] [2023-08-24 15:39:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131902213] [2023-08-24 15:39:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131902213] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134753535] [2023-08-24 15:39:39,626 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:39:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:39,627 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:39,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-24 15:39:39,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:39:39,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:39,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 15:39:39,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:39,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134753535] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:39,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-08-24 15:39:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470639136] [2023-08-24 15:39:39,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 15:39:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 15:39:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-08-24 15:39:39,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:39,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 594 transitions, 9256 flow. Second operand has 19 states, 19 states have (on average 100.15789473684211) internal successors, (1903), 19 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:39,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:39,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:39,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:40,907 INFO L124 PetriNetUnfolderBase]: 3234/4608 cut-off events. [2023-08-24 15:39:40,907 INFO L125 PetriNetUnfolderBase]: For 198253/198348 co-relation queries the response was YES. [2023-08-24 15:39:40,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50944 conditions, 4608 events. 3234/4608 cut-off events. For 198253/198348 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20755 event pairs, 417 based on Foata normal form. 62/4643 useless extension candidates. Maximal degree in co-relation 50856. Up to 2562 conditions per place. [2023-08-24 15:39:40,954 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 534 selfloop transitions, 165 changer transitions 0/727 dead transitions. [2023-08-24 15:39:40,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 727 transitions, 13210 flow [2023-08-24 15:39:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1048 transitions. [2023-08-24 15:39:40,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3742857142857143 [2023-08-24 15:39:40,955 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1048 transitions. [2023-08-24 15:39:40,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1048 transitions. [2023-08-24 15:39:40,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:40,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1048 transitions. [2023-08-24 15:39:40,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.8) internal successors, (1048), 10 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:40,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:40,959 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:40,959 INFO L175 Difference]: Start difference. First operand has 263 places, 594 transitions, 9256 flow. Second operand 10 states and 1048 transitions. [2023-08-24 15:39:40,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 727 transitions, 13210 flow [2023-08-24 15:39:41,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 727 transitions, 10863 flow, removed 1111 selfloop flow, removed 10 redundant places. [2023-08-24 15:39:41,594 INFO L231 Difference]: Finished difference. Result has 252 places, 577 transitions, 7989 flow [2023-08-24 15:39:41,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=7054, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7989, PETRI_PLACES=252, PETRI_TRANSITIONS=577} [2023-08-24 15:39:41,604 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2023-08-24 15:39:41,604 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 577 transitions, 7989 flow [2023-08-24 15:39:41,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 100.15789473684211) internal successors, (1903), 19 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:41,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:41,604 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-24 15:39:41,809 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:41,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2031205016, now seen corresponding path program 19 times [2023-08-24 15:39:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:41,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757427443] [2023-08-24 15:39:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757427443] [2023-08-24 15:39:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757427443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349429442] [2023-08-24 15:39:41,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:39:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:41,925 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:41,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-24 15:39:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:42,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 15:39:42,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:42,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349429442] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:42,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 15:39:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199221069] [2023-08-24 15:39:42,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:42,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 15:39:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 15:39:42,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-08-24 15:39:42,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:42,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 577 transitions, 7989 flow. Second operand has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:42,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:42,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:42,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:43,305 INFO L124 PetriNetUnfolderBase]: 3379/4842 cut-off events. [2023-08-24 15:39:43,305 INFO L125 PetriNetUnfolderBase]: For 208113/208177 co-relation queries the response was YES. [2023-08-24 15:39:43,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49991 conditions, 4842 events. 3379/4842 cut-off events. For 208113/208177 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 22187 event pairs, 604 based on Foata normal form. 20/4840 useless extension candidates. Maximal degree in co-relation 49903. Up to 3601 conditions per place. [2023-08-24 15:39:43,354 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 512 selfloop transitions, 202 changer transitions 0/742 dead transitions. [2023-08-24 15:39:43,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 742 transitions, 12098 flow [2023-08-24 15:39:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 15:39:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 15:39:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1363 transitions. [2023-08-24 15:39:43,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37445054945054945 [2023-08-24 15:39:43,356 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1363 transitions. [2023-08-24 15:39:43,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1363 transitions. [2023-08-24 15:39:43,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:43,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1363 transitions. [2023-08-24 15:39:43,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.84615384615384) internal successors, (1363), 13 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:43,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:43,359 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:43,359 INFO L175 Difference]: Start difference. First operand has 252 places, 577 transitions, 7989 flow. Second operand 13 states and 1363 transitions. [2023-08-24 15:39:43,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 742 transitions, 12098 flow [2023-08-24 15:39:44,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 742 transitions, 11879 flow, removed 67 selfloop flow, removed 5 redundant places. [2023-08-24 15:39:44,191 INFO L231 Difference]: Finished difference. Result has 262 places, 625 transitions, 9422 flow [2023-08-24 15:39:44,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=7830, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9422, PETRI_PLACES=262, PETRI_TRANSITIONS=625} [2023-08-24 15:39:44,192 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2023-08-24 15:39:44,192 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 625 transitions, 9422 flow [2023-08-24 15:39:44,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:44,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:44,193 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:44,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:44,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-24 15:39:44,397 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:44,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1977244338, now seen corresponding path program 20 times [2023-08-24 15:39:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:44,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626271864] [2023-08-24 15:39:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:44,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:44,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626271864] [2023-08-24 15:39:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626271864] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:44,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336285558] [2023-08-24 15:39:44,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:39:44,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:44,525 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:44,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-24 15:39:44,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:44,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:44,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 15:39:44,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:44,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336285558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:44,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 15:39:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897086089] [2023-08-24 15:39:44,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:44,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 15:39:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 15:39:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-08-24 15:39:44,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:44,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 625 transitions, 9422 flow. Second operand has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:44,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:44,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:44,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:46,045 INFO L124 PetriNetUnfolderBase]: 3565/5159 cut-off events. [2023-08-24 15:39:46,046 INFO L125 PetriNetUnfolderBase]: For 153154/153220 co-relation queries the response was YES. [2023-08-24 15:39:46,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50056 conditions, 5159 events. 3565/5159 cut-off events. For 153154/153220 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24204 event pairs, 346 based on Foata normal form. 36/5182 useless extension candidates. Maximal degree in co-relation 49965. Up to 2698 conditions per place. [2023-08-24 15:39:46,099 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 453 selfloop transitions, 310 changer transitions 0/791 dead transitions. [2023-08-24 15:39:46,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 791 transitions, 13414 flow [2023-08-24 15:39:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 15:39:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 15:39:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1801 transitions. [2023-08-24 15:39:46,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3783613445378151 [2023-08-24 15:39:46,101 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1801 transitions. [2023-08-24 15:39:46,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1801 transitions. [2023-08-24 15:39:46,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:46,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1801 transitions. [2023-08-24 15:39:46,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 105.94117647058823) internal successors, (1801), 17 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:46,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 280.0) internal successors, (5040), 18 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:46,105 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 280.0) internal successors, (5040), 18 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:46,105 INFO L175 Difference]: Start difference. First operand has 262 places, 625 transitions, 9422 flow. Second operand 17 states and 1801 transitions. [2023-08-24 15:39:46,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 791 transitions, 13414 flow [2023-08-24 15:39:46,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 791 transitions, 13106 flow, removed 85 selfloop flow, removed 5 redundant places. [2023-08-24 15:39:46,745 INFO L231 Difference]: Finished difference. Result has 276 places, 642 transitions, 10080 flow [2023-08-24 15:39:46,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9123, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10080, PETRI_PLACES=276, PETRI_TRANSITIONS=642} [2023-08-24 15:39:46,745 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2023-08-24 15:39:46,745 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 642 transitions, 10080 flow [2023-08-24 15:39:46,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 99.81818181818181) internal successors, (2196), 22 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:46,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:46,746 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:46,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:46,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-24 15:39:46,950 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:46,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 235968742, now seen corresponding path program 21 times [2023-08-24 15:39:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9514993] [2023-08-24 15:39:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9514993] [2023-08-24 15:39:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9514993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575727610] [2023-08-24 15:39:47,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:39:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:47,058 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:47,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-24 15:39:47,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:39:47,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:47,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 15:39:47,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:47,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575727610] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:47,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-24 15:39:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948828313] [2023-08-24 15:39:47,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 15:39:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 15:39:47,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-24 15:39:47,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:47,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 642 transitions, 10080 flow. Second operand has 20 states, 20 states have (on average 100.0) internal successors, (2000), 20 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:47,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:47,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:47,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:48,394 INFO L124 PetriNetUnfolderBase]: 3579/5191 cut-off events. [2023-08-24 15:39:48,395 INFO L125 PetriNetUnfolderBase]: For 146789/146847 co-relation queries the response was YES. [2023-08-24 15:39:48,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51225 conditions, 5191 events. 3579/5191 cut-off events. For 146789/146847 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24485 event pairs, 426 based on Foata normal form. 30/5202 useless extension candidates. Maximal degree in co-relation 51131. Up to 2726 conditions per place. [2023-08-24 15:39:48,444 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 444 selfloop transitions, 241 changer transitions 0/712 dead transitions. [2023-08-24 15:39:48,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 712 transitions, 12489 flow [2023-08-24 15:39:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2023-08-24 15:39:48,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37392857142857144 [2023-08-24 15:39:48,446 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2023-08-24 15:39:48,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2023-08-24 15:39:48,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:48,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2023-08-24 15:39:48,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:48,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:48,448 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:48,448 INFO L175 Difference]: Start difference. First operand has 276 places, 642 transitions, 10080 flow. Second operand 10 states and 1047 transitions. [2023-08-24 15:39:48,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 712 transitions, 12489 flow [2023-08-24 15:39:49,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 712 transitions, 11990 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-08-24 15:39:49,142 INFO L231 Difference]: Finished difference. Result has 273 places, 639 transitions, 10047 flow [2023-08-24 15:39:49,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9555, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10047, PETRI_PLACES=273, PETRI_TRANSITIONS=639} [2023-08-24 15:39:49,143 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2023-08-24 15:39:49,143 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 639 transitions, 10047 flow [2023-08-24 15:39:49,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 100.0) internal successors, (2000), 20 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:49,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:49,144 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:49,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-24 15:39:49,349 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:49,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1735463462, now seen corresponding path program 22 times [2023-08-24 15:39:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285582904] [2023-08-24 15:39:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285582904] [2023-08-24 15:39:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285582904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425239886] [2023-08-24 15:39:49,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:39:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:49,439 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:49,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-24 15:39:49,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:39:49,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:49,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:49,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:49,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425239886] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:49,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-08-24 15:39:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90698385] [2023-08-24 15:39:49,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 15:39:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 15:39:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-08-24 15:39:49,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 280 [2023-08-24 15:39:49,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 639 transitions, 10047 flow. Second operand has 17 states, 17 states have (on average 96.58823529411765) internal successors, (1642), 17 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:49,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:49,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 280 [2023-08-24 15:39:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:51,154 INFO L124 PetriNetUnfolderBase]: 3609/5212 cut-off events. [2023-08-24 15:39:51,154 INFO L125 PetriNetUnfolderBase]: For 146231/146231 co-relation queries the response was YES. [2023-08-24 15:39:51,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51571 conditions, 5212 events. 3609/5212 cut-off events. For 146231/146231 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24204 event pairs, 369 based on Foata normal form. 28/5236 useless extension candidates. Maximal degree in co-relation 51477. Up to 2690 conditions per place. [2023-08-24 15:39:51,205 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 485 selfloop transitions, 370 changer transitions 1/856 dead transitions. [2023-08-24 15:39:51,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 856 transitions, 15426 flow [2023-08-24 15:39:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 15:39:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 15:39:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2001 transitions. [2023-08-24 15:39:51,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35732142857142857 [2023-08-24 15:39:51,207 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2001 transitions. [2023-08-24 15:39:51,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2001 transitions. [2023-08-24 15:39:51,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:51,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2001 transitions. [2023-08-24 15:39:51,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 100.05) internal successors, (2001), 20 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:51,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 280.0) internal successors, (5880), 21 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:51,211 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 280.0) internal successors, (5880), 21 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:51,211 INFO L175 Difference]: Start difference. First operand has 273 places, 639 transitions, 10047 flow. Second operand 20 states and 2001 transitions. [2023-08-24 15:39:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 856 transitions, 15426 flow [2023-08-24 15:39:51,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 856 transitions, 14855 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 15:39:51,830 INFO L231 Difference]: Finished difference. Result has 287 places, 695 transitions, 11394 flow [2023-08-24 15:39:51,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=9596, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11394, PETRI_PLACES=287, PETRI_TRANSITIONS=695} [2023-08-24 15:39:51,831 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 257 predicate places. [2023-08-24 15:39:51,831 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 695 transitions, 11394 flow [2023-08-24 15:39:51,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 96.58823529411765) internal successors, (1642), 17 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:51,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:51,832 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:51,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:52,036 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:52,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2092160244, now seen corresponding path program 23 times [2023-08-24 15:39:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535857283] [2023-08-24 15:39:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535857283] [2023-08-24 15:39:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535857283] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696390539] [2023-08-24 15:39:52,172 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:39:52,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:52,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:52,173 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:52,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-24 15:39:52,278 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:52,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:52,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:52,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:52,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:52,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696390539] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:52,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-08-24 15:39:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521055331] [2023-08-24 15:39:52,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 15:39:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:52,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 15:39:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-08-24 15:39:52,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 280 [2023-08-24 15:39:52,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 695 transitions, 11394 flow. Second operand has 19 states, 19 states have (on average 96.26315789473684) internal successors, (1829), 19 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:52,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:52,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 280 [2023-08-24 15:39:52,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:54,230 INFO L124 PetriNetUnfolderBase]: 3654/5287 cut-off events. [2023-08-24 15:39:54,230 INFO L125 PetriNetUnfolderBase]: For 149848/149848 co-relation queries the response was YES. [2023-08-24 15:39:54,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53134 conditions, 5287 events. 3654/5287 cut-off events. For 149848/149848 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24773 event pairs, 355 based on Foata normal form. 30/5317 useless extension candidates. Maximal degree in co-relation 53037. Up to 2732 conditions per place. [2023-08-24 15:39:54,275 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 523 selfloop transitions, 453 changer transitions 1/977 dead transitions. [2023-08-24 15:39:54,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 977 transitions, 17760 flow [2023-08-24 15:39:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-24 15:39:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-24 15:39:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3501 transitions. [2023-08-24 15:39:54,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3572448979591837 [2023-08-24 15:39:54,279 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3501 transitions. [2023-08-24 15:39:54,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3501 transitions. [2023-08-24 15:39:54,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:54,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3501 transitions. [2023-08-24 15:39:54,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 100.02857142857142) internal successors, (3501), 35 states have internal predecessors, (3501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:54,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 280.0) internal successors, (10080), 36 states have internal predecessors, (10080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:54,286 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 280.0) internal successors, (10080), 36 states have internal predecessors, (10080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:54,286 INFO L175 Difference]: Start difference. First operand has 287 places, 695 transitions, 11394 flow. Second operand 35 states and 3501 transitions. [2023-08-24 15:39:54,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 977 transitions, 17760 flow [2023-08-24 15:39:54,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 977 transitions, 17317 flow, removed 94 selfloop flow, removed 8 redundant places. [2023-08-24 15:39:54,936 INFO L231 Difference]: Finished difference. Result has 316 places, 794 transitions, 13858 flow [2023-08-24 15:39:54,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=10999, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=13858, PETRI_PLACES=316, PETRI_TRANSITIONS=794} [2023-08-24 15:39:54,937 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2023-08-24 15:39:54,937 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 794 transitions, 13858 flow [2023-08-24 15:39:54,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 96.26315789473684) internal successors, (1829), 19 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:54,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:54,938 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:54,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-24 15:39:55,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:55,147 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:55,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1981022802, now seen corresponding path program 24 times [2023-08-24 15:39:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:55,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573975806] [2023-08-24 15:39:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573975806] [2023-08-24 15:39:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573975806] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159625124] [2023-08-24 15:39:55,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:39:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:55,223 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:55,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-24 15:39:55,350 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:39:55,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:55,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 15:39:55,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:55,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159625124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:55,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-08-24 15:39:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427850594] [2023-08-24 15:39:55,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:55,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 15:39:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 15:39:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-24 15:39:55,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 280 [2023-08-24 15:39:55,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 794 transitions, 13858 flow. Second operand has 19 states, 19 states have (on average 100.05263157894737) internal successors, (1901), 19 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:55,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:55,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 280 [2023-08-24 15:39:55,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:56,770 INFO L124 PetriNetUnfolderBase]: 3560/5150 cut-off events. [2023-08-24 15:39:56,770 INFO L125 PetriNetUnfolderBase]: For 149701/149747 co-relation queries the response was YES. [2023-08-24 15:39:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52938 conditions, 5150 events. 3560/5150 cut-off events. For 149701/149747 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 24081 event pairs, 711 based on Foata normal form. 38/5173 useless extension candidates. Maximal degree in co-relation 52841. Up to 4082 conditions per place. [2023-08-24 15:39:56,826 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 602 selfloop transitions, 203 changer transitions 0/839 dead transitions. [2023-08-24 15:39:56,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 839 transitions, 15991 flow [2023-08-24 15:39:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:39:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:39:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1042 transitions. [2023-08-24 15:39:56,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37214285714285716 [2023-08-24 15:39:56,828 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1042 transitions. [2023-08-24 15:39:56,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1042 transitions. [2023-08-24 15:39:56,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:56,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1042 transitions. [2023-08-24 15:39:56,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.2) internal successors, (1042), 10 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:56,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:56,831 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:56,831 INFO L175 Difference]: Start difference. First operand has 316 places, 794 transitions, 13858 flow. Second operand 10 states and 1042 transitions. [2023-08-24 15:39:56,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 839 transitions, 15991 flow [2023-08-24 15:39:57,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 839 transitions, 14874 flow, removed 354 selfloop flow, removed 12 redundant places. [2023-08-24 15:39:57,648 INFO L231 Difference]: Finished difference. Result has 308 places, 781 transitions, 12876 flow [2023-08-24 15:39:57,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=12470, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12876, PETRI_PLACES=308, PETRI_TRANSITIONS=781} [2023-08-24 15:39:57,649 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 278 predicate places. [2023-08-24 15:39:57,649 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 781 transitions, 12876 flow [2023-08-24 15:39:57,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 100.05263157894737) internal successors, (1901), 19 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:57,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:57,650 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 15:39:57,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-08-24 15:39:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-24 15:39:57,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 15:39:57,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1607102098, now seen corresponding path program 5 times [2023-08-24 15:39:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980349001] [2023-08-24 15:39:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980349001] [2023-08-24 15:39:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980349001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87245902] [2023-08-24 15:39:58,748 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:39:58,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:58,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:58,753 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:39:58,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-24 15:39:58,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:39:58,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:58,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-24 15:39:58,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:59,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:59,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:39:59,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:59,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:39:59,647 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:39:59,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:59,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 76 [2023-08-24 15:39:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:39:59,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:40:00,642 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (<= .cse0 c_~max1~0) (< c_~max2~0 (select .cse1 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (<= .cse2 c_~max2~0) (= .cse0 .cse2)))))))) (or (forall ((v_ArrVal_1452 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< c_~max2~0 (select .cse4 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))) (< c_~max2~0 (select .cse4 c_~A~0.offset)) (< c_~max1~0 (select .cse4 .cse3))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse3)) (.cse5 (select .cse6 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< .cse5 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))) (= .cse5 .cse7) (<= .cse7 c_~max1~0) (<= .cse5 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse3)) (.cse9 (select .cse11 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse8 (select .cse11 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (<= .cse8 .cse9) (= .cse10 .cse8)))) (<= .cse10 c_~max1~0) (<= .cse9 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (= c_~max1~0 .cse12) (<= .cse12 c_~max2~0)))) (< c_~max2~0 (select .cse13 c_~A~0.offset)) (< c_~max1~0 (select .cse13 .cse3))))) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse3))) (or (= .cse14 c_~max2~0) (<= .cse14 c_~max1~0) (< c_~max2~0 (select .cse15 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< c_~max2~0 (select .cse15 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))))))) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse16 (select .cse17 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< .cse16 (select .cse17 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))) (= .cse16 c_~max1~0) (< c_~max1~0 (select .cse17 .cse3)) (<= .cse16 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (= c_~max1~0 .cse18) (<= .cse18 .cse19)))) (< c_~max1~0 (select .cse20 .cse3)) (<= .cse19 c_~max2~0))))))) is different from false [2023-08-24 15:40:00,898 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (or (< c_~max2~0 (select .cse0 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (= .cse1 c_~max1~0) (<= .cse1 c_~max2~0)))) (< c_~max1~0 (select .cse0 .cse2))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse5 (select .cse3 .cse2))) (or (< c_~max2~0 (select .cse3 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (= .cse4 .cse5) (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (<= .cse4 c_~max2~0)))) (<= .cse5 c_~max1~0))))) (or (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< c_~max2~0 (select .cse6 c_~A~0.offset)) (< c_~max1~0 (select .cse6 .cse2)) (< c_~max2~0 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse2)) (.cse9 (select .cse10 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse7 (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (= .cse7 .cse8) (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (<= .cse7 .cse9)))) (<= .cse8 c_~max1~0) (<= .cse9 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse2))) (or (= c_~max2~0 .cse11) (< c_~max2~0 (select .cse12 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< c_~max2~0 (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))) (<= .cse11 c_~max1~0))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse14 (select .cse13 c_~A~0.offset))) (or (< c_~max1~0 (select .cse13 .cse2)) (= c_~max1~0 .cse14) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< .cse14 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))) (<= .cse14 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse2)) (.cse15 (select .cse17 c_~A~0.offset))) (or (= .cse15 .cse16) (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (< .cse15 (select .cse17 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4)))))) (<= .cse16 c_~max1~0) (<= .cse15 c_~max2~0))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1452) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_165 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_165 4))))) (or (<= c_~N~0 v_thread3Thread1of1ForFork1_~i~2_165) (< v_thread3Thread1of1ForFork1_~i~2_165 1) (<= .cse18 .cse19) (= .cse18 c_~max1~0)))) (< c_~max1~0 (select .cse20 .cse2)) (<= .cse19 c_~max2~0))))))) is different from false [2023-08-24 15:40:01,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:01,442 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 3355 treesize of output 3399 [2023-08-24 15:40:01,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:01,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1883 treesize of output 1884 [2023-08-24 15:40:01,881 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:01,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1855 treesize of output 1828 [2023-08-24 15:40:02,036 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1799 treesize of output 1790 [2023-08-24 15:40:02,189 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1761 treesize of output 1771 [2023-08-24 15:40:02,363 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1742 treesize of output 1711 [2023-08-24 15:40:02,519 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1682 treesize of output 1659 [2023-08-24 15:40:02,686 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1630 treesize of output 1633 [2023-08-24 15:40:02,886 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:02,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1604 treesize of output 1618 [2023-08-24 15:40:03,039 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 15:40:03,099 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:03,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1589 treesize of output 1588 [2023-08-24 15:40:03,282 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:03,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1559 treesize of output 1546 [2023-08-24 15:40:03,481 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:03,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1517 treesize of output 1525 [2023-08-24 15:40:03,680 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:03,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1496 treesize of output 1495 [2023-08-24 15:40:03,896 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:03,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1466 treesize of output 1473 [2023-08-24 15:40:04,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:04,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1444 treesize of output 1429 [2023-08-24 15:40:04,350 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:04,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1400 treesize of output 1406 [2023-08-24 15:40:04,576 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:40:04,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1377 treesize of output 1360 Received shutdown request... [2023-08-24 15:52:48,917 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 15:52:48,918 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 15:52:48,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-24 15:52:48,941 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 15:52:48,942 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 15:52:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:52:49,119 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 47ms.. [2023-08-24 15:52:49,120 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 15:52:49,121 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 15:52:49,121 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 15:52:49,121 INFO L445 BasicCegarLoop]: Path program histogram: [24, 5, 1, 1, 1, 1] [2023-08-24 15:52:49,123 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 15:52:49,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 15:52:49,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 03:52:49 BasicIcfg [2023-08-24 15:52:49,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 15:52:49,125 INFO L158 Benchmark]: Toolchain (without parser) took 858186.09ms. Allocated memory was 377.5MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 353.5MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 353.7MB in the beginning and 353.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.93ms. Allocated memory is still 377.5MB. Free memory was 353.5MB in the beginning and 341.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 377.5MB. Free memory was 341.6MB in the beginning and 340.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 377.5MB. Free memory was 340.1MB in the beginning and 338.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: RCFGBuilder took 348.42ms. Allocated memory is still 377.5MB. Free memory was 338.0MB in the beginning and 317.5MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 15:52:49,125 INFO L158 Benchmark]: TraceAbstraction took 857557.13ms. Allocated memory was 377.5MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 316.5MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-24 15:52:49,126 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory was 353.7MB in the beginning and 353.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 203.93ms. Allocated memory is still 377.5MB. Free memory was 353.5MB in the beginning and 341.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 377.5MB. Free memory was 341.6MB in the beginning and 340.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 377.5MB. Free memory was 340.1MB in the beginning and 338.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 348.42ms. Allocated memory is still 377.5MB. Free memory was 338.0MB in the beginning and 317.5MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 857557.13ms. Allocated memory was 377.5MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 316.5MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 133 PlacesBefore, 30 PlacesAfterwards, 135 TransitionsBefore, 24 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 132 TotalNumberOfCompositions, 1676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1594, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 813, independent: 805, independent conditional: 0, independent unconditional: 805, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1594, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 813, unknown conditional: 0, unknown unconditional: 813] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 47ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 47ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 47ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 47ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 170 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 857.5s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3975 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3975 mSDsluCounter, 1398 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19960 IncrementalHoareTripleChecker+Invalid, 20194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 166 mSDtfsCounter, 19960 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2038 GetRequests, 1058 SyntacticMatches, 49 SemanticMatches, 931 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9925 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13858occurred in iteration=31, InterpolantAutomatonStates: 549, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 1463 NumberOfCodeBlocks, 1447 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 2082 ConstructedInterpolants, 25 QuantifiedInterpolants, 21397 SizeOfPredicates, 266 NumberOfNonLiveVariables, 6300 ConjunctsInSsa, 573 ConjunctsInUnsatCore, 92 InterpolantComputations, 4 PerfectInterpolantSequences, 176/391 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown