/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:36:50,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:36:50,539 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-NoLbe.epf [2023-12-09 15:36:50,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:36:50,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:36:50,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:36:50,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:36:50,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:36:50,566 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:36:50,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:36:50,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:36:50,570 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:36:50,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:36:50,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:36:50,572 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:36:50,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:36:50,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:36:50,572 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:36:50,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:36:50,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:50,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:36:50,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:36:50,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:36:50,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:36:50,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:36:50,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:36:50,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:36:50,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:36:50,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:36:50,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:36:50,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:36:50,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:36:50,776 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:36:50,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-12-09 15:36:51,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:36:51,880 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:36:51,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-12-09 15:36:51,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb80870d2/3d9e137245cc49b49e6aa38f977acf1f/FLAG86d83afdb [2023-12-09 15:36:51,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb80870d2/3d9e137245cc49b49e6aa38f977acf1f [2023-12-09 15:36:51,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:36:51,901 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:36:51,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:51,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:36:51,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:36:51,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:51" (1/1) ... [2023-12-09 15:36:51,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59581507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:51, skipping insertion in model container [2023-12-09 15:36:51,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:51" (1/1) ... [2023-12-09 15:36:51,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:36:52,032 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/unroll-2.wvr.c[2454,2467] [2023-12-09 15:36:52,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:52,045 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:36:52,060 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/unroll-2.wvr.c[2454,2467] [2023-12-09 15:36:52,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:52,071 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:36:52,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52 WrapperNode [2023-12-09 15:36:52,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:52,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:52,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:36:52,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:36:52,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,097 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 139 [2023-12-09 15:36:52,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:52,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:36:52,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:36:52,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:36:52,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:36:52,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:36:52,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:36:52,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:36:52,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (1/1) ... [2023-12-09 15:36:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:52,145 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-12-09 15:36:52,163 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-12-09 15:36:52,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:36:52,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:36:52,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:36:52,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:36:52,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:36:52,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:36:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:36:52,173 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:36:52,253 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:36:52,254 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:36:52,442 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:36:52,457 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:36:52,457 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:36:52,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:52 BoogieIcfgContainer [2023-12-09 15:36:52,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:36:52,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:36:52,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:36:52,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:36:52,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:36:51" (1/3) ... [2023-12-09 15:36:52,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfa024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:52, skipping insertion in model container [2023-12-09 15:36:52,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:52" (2/3) ... [2023-12-09 15:36:52,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfa024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:52, skipping insertion in model container [2023-12-09 15:36:52,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:52" (3/3) ... [2023-12-09 15:36:52,470 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2023-12-09 15:36:52,482 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:36:52,482 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:36:52,482 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:36:52,543 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:36:52,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 173 transitions, 360 flow [2023-12-09 15:36:52,624 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-12-09 15:36:52,624 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:36:52,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-12-09 15:36:52,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 173 transitions, 360 flow [2023-12-09 15:36:52,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 162 transitions, 336 flow [2023-12-09 15:36:52,640 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:36:52,644 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@622b541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:36:52,644 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:36:52,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:36:52,674 INFO L124 PetriNetUnfolderBase]: 13/158 cut-off events. [2023-12-09 15:36:52,674 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:36:52,688 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:52,689 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:52,689 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:52,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1963916174, now seen corresponding path program 1 times [2023-12-09 15:36:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358300620] [2023-12-09 15:36:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358300620] [2023-12-09 15:36:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358300620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:36:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789314103] [2023-12-09 15:36:53,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:53,237 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:36:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:36:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:36:53,274 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 173 [2023-12-09 15:36:53,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 162 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:53,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 173 [2023-12-09 15:36:53,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:53,447 INFO L124 PetriNetUnfolderBase]: 14/226 cut-off events. [2023-12-09 15:36:53,447 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-12-09 15:36:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 226 events. 14/226 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs, 5 based on Foata normal form. 25/231 useless extension candidates. Maximal degree in co-relation 160. Up to 41 conditions per place. [2023-12-09 15:36:53,450 INFO L140 encePairwiseOnDemand]: 152/173 looper letters, 47 selfloop transitions, 9 changer transitions 5/155 dead transitions. [2023-12-09 15:36:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 155 transitions, 444 flow [2023-12-09 15:36:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:36:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:36:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 906 transitions. [2023-12-09 15:36:53,467 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6546242774566474 [2023-12-09 15:36:53,468 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 906 transitions. [2023-12-09 15:36:53,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 906 transitions. [2023-12-09 15:36:53,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:53,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 906 transitions. [2023-12-09 15:36:53,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,481 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,483 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 7 predicate places. [2023-12-09 15:36:53,483 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 444 flow [2023-12-09 15:36:53,484 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,484 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:53,484 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:53,484 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:36:53,484 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:53,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 33060110, now seen corresponding path program 1 times [2023-12-09 15:36:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907479353] [2023-12-09 15:36:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907479353] [2023-12-09 15:36:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907479353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:53,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:36:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765036015] [2023-12-09 15:36:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:53,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:36:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:36:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:36:53,692 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 173 [2023-12-09 15:36:53,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:53,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 173 [2023-12-09 15:36:53,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:53,882 INFO L124 PetriNetUnfolderBase]: 73/538 cut-off events. [2023-12-09 15:36:53,883 INFO L125 PetriNetUnfolderBase]: For 168/173 co-relation queries the response was YES. [2023-12-09 15:36:53,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 538 events. 73/538 cut-off events. For 168/173 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2596 event pairs, 20 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 589. Up to 98 conditions per place. [2023-12-09 15:36:53,888 INFO L140 encePairwiseOnDemand]: 161/173 looper letters, 65 selfloop transitions, 5 changer transitions 11/186 dead transitions. [2023-12-09 15:36:53,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 725 flow [2023-12-09 15:36:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:36:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:36:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2023-12-09 15:36:53,891 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6942838792549775 [2023-12-09 15:36:53,891 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2023-12-09 15:36:53,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2023-12-09 15:36:53,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:53,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2023-12-09 15:36:53,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,897 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,898 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 15 predicate places. [2023-12-09 15:36:53,898 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 186 transitions, 725 flow [2023-12-09 15:36:53,899 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:53,899 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:53,899 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:53,899 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:36:53,899 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:53,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -499559490, now seen corresponding path program 1 times [2023-12-09 15:36:53,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:53,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208607049] [2023-12-09 15:36:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208607049] [2023-12-09 15:36:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208607049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:36:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551514038] [2023-12-09 15:36:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:54,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:36:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:36:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:36:54,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:54,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 186 transitions, 725 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:54,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:54,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:54,302 INFO L124 PetriNetUnfolderBase]: 203/995 cut-off events. [2023-12-09 15:36:54,305 INFO L125 PetriNetUnfolderBase]: For 682/718 co-relation queries the response was YES. [2023-12-09 15:36:54,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 995 events. 203/995 cut-off events. For 682/718 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5941 event pairs, 80 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 1451. Up to 200 conditions per place. [2023-12-09 15:36:54,312 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 35 selfloop transitions, 5 changer transitions 16/208 dead transitions. [2023-12-09 15:36:54,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 208 transitions, 917 flow [2023-12-09 15:36:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:36:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:36:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions. [2023-12-09 15:36:54,314 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.859344894026975 [2023-12-09 15:36:54,314 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 892 transitions. [2023-12-09 15:36:54,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions. [2023-12-09 15:36:54,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:54,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions. [2023-12-09 15:36:54,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,321 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 20 predicate places. [2023-12-09 15:36:54,321 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 208 transitions, 917 flow [2023-12-09 15:36:54,322 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,322 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:54,322 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:54,322 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:36:54,323 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:54,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1369216784, now seen corresponding path program 2 times [2023-12-09 15:36:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495541522] [2023-12-09 15:36:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495541522] [2023-12-09 15:36:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495541522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047843884] [2023-12-09 15:36:54,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:36:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:54,550 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-12-09 15:36:54,584 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-12-09 15:36:54,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:36:54,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:36:54,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:36:54,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:36:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:54,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:36:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047843884] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:36:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-12-09 15:36:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032237906] [2023-12-09 15:36:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:54,806 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:36:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:36:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:36:54,807 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2023-12-09 15:36:54,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 208 transitions, 917 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:54,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2023-12-09 15:36:54,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:54,946 INFO L124 PetriNetUnfolderBase]: 201/1074 cut-off events. [2023-12-09 15:36:54,946 INFO L125 PetriNetUnfolderBase]: For 887/911 co-relation queries the response was YES. [2023-12-09 15:36:54,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 1074 events. 201/1074 cut-off events. For 887/911 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6584 event pairs, 52 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 1815. Up to 206 conditions per place. [2023-12-09 15:36:54,951 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 40 selfloop transitions, 8 changer transitions 18/226 dead transitions. [2023-12-09 15:36:54,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 226 transitions, 1134 flow [2023-12-09 15:36:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:36:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:36:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2023-12-09 15:36:54,954 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.880057803468208 [2023-12-09 15:36:54,954 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 609 transitions. [2023-12-09 15:36:54,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 609 transitions. [2023-12-09 15:36:54,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:54,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 609 transitions. [2023-12-09 15:36:54,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,958 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 23 predicate places. [2023-12-09 15:36:54,959 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 226 transitions, 1134 flow [2023-12-09 15:36:54,959 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:54,959 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:54,959 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:54,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:36:55,164 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:55,165 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:55,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:55,165 INFO L85 PathProgramCache]: Analyzing trace with hash 613534818, now seen corresponding path program 3 times [2023-12-09 15:36:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:55,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416455192] [2023-12-09 15:36:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416455192] [2023-12-09 15:36:55,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416455192] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761798918] [2023-12-09 15:36:55,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:36:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:55,333 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-12-09 15:36:55,343 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-12-09 15:36:55,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:36:55,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:36:55,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:36:55,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:36:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:55,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:36:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761798918] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:36:55,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:36:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2023-12-09 15:36:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280335749] [2023-12-09 15:36:55,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:36:55,604 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:36:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:36:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:36:55,606 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:55,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 226 transitions, 1134 flow. Second operand has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:55,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:55,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:55,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:55,867 INFO L124 PetriNetUnfolderBase]: 332/1639 cut-off events. [2023-12-09 15:36:55,868 INFO L125 PetriNetUnfolderBase]: For 2176/2389 co-relation queries the response was YES. [2023-12-09 15:36:55,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 1639 events. 332/1639 cut-off events. For 2176/2389 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11891 event pairs, 71 based on Foata normal form. 16/1485 useless extension candidates. Maximal degree in co-relation 3406. Up to 268 conditions per place. [2023-12-09 15:36:55,881 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 99 selfloop transitions, 39 changer transitions 23/313 dead transitions. [2023-12-09 15:36:55,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 313 transitions, 1997 flow [2023-12-09 15:36:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:36:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:36:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1508 transitions. [2023-12-09 15:36:55,885 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8716763005780347 [2023-12-09 15:36:55,885 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1508 transitions. [2023-12-09 15:36:55,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1508 transitions. [2023-12-09 15:36:55,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:55,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1508 transitions. [2023-12-09 15:36:55,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.8) internal successors, (1508), 10 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:55,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 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-12-09 15:36:55,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 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-12-09 15:36:55,893 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 32 predicate places. [2023-12-09 15:36:55,893 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 313 transitions, 1997 flow [2023-12-09 15:36:55,893 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:55,893 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:55,894 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:55,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:36:56,101 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:56,102 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:56,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1959887028, now seen corresponding path program 4 times [2023-12-09 15:36:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:56,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247354857] [2023-12-09 15:36:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:56,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247354857] [2023-12-09 15:36:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247354857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:36:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822848102] [2023-12-09 15:36:56,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:56,263 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:36:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:36:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:36:56,264 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:56,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 313 transitions, 1997 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:56,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:56,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:56,448 INFO L124 PetriNetUnfolderBase]: 332/1666 cut-off events. [2023-12-09 15:36:56,448 INFO L125 PetriNetUnfolderBase]: For 3162/3644 co-relation queries the response was YES. [2023-12-09 15:36:56,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 1666 events. 332/1666 cut-off events. For 3162/3644 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12154 event pairs, 81 based on Foata normal form. 27/1522 useless extension candidates. Maximal degree in co-relation 3233. Up to 268 conditions per place. [2023-12-09 15:36:56,458 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 121 selfloop transitions, 17 changer transitions 23/313 dead transitions. [2023-12-09 15:36:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 313 transitions, 2303 flow [2023-12-09 15:36:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:36:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:36:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2023-12-09 15:36:56,460 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8739884393063584 [2023-12-09 15:36:56,460 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2023-12-09 15:36:56,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2023-12-09 15:36:56,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:56,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2023-12-09 15:36:56,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,464 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 36 predicate places. [2023-12-09 15:36:56,464 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 313 transitions, 2303 flow [2023-12-09 15:36:56,465 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,465 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:56,465 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:56,465 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:36:56,466 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:56,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1107705814, now seen corresponding path program 5 times [2023-12-09 15:36:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474995517] [2023-12-09 15:36:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474995517] [2023-12-09 15:36:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474995517] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500077801] [2023-12-09 15:36:56,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:36:56,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:56,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:56,596 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-12-09 15:36:56,598 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-12-09 15:36:56,690 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:36:56,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:36:56,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:36:56,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:36:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:56,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:36:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500077801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:36:56,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:36:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-12-09 15:36:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416695387] [2023-12-09 15:36:56,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:36:56,819 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:36:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:36:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:36:56,821 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:56,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 313 transitions, 2303 flow. Second operand has 10 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:56,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:56,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:56,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:57,049 INFO L124 PetriNetUnfolderBase]: 331/1644 cut-off events. [2023-12-09 15:36:57,049 INFO L125 PetriNetUnfolderBase]: For 4335/5138 co-relation queries the response was YES. [2023-12-09 15:36:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4937 conditions, 1644 events. 331/1644 cut-off events. For 4335/5138 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 11909 event pairs, 78 based on Foata normal form. 37/1516 useless extension candidates. Maximal degree in co-relation 3609. Up to 262 conditions per place. [2023-12-09 15:36:57,060 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 106 selfloop transitions, 30 changer transitions 23/311 dead transitions. [2023-12-09 15:36:57,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 311 transitions, 2578 flow [2023-12-09 15:36:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:36:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:36:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2023-12-09 15:36:57,063 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8641618497109826 [2023-12-09 15:36:57,063 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2023-12-09 15:36:57,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2023-12-09 15:36:57,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:57,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2023-12-09 15:36:57,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.5) internal successors, (1196), 8 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,068 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,068 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 43 predicate places. [2023-12-09 15:36:57,069 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 311 transitions, 2578 flow [2023-12-09 15:36:57,070 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,070 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:57,070 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:57,074 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-12-09 15:36:57,274 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:57,275 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:57,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash -420189570, now seen corresponding path program 1 times [2023-12-09 15:36:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:57,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557723658] [2023-12-09 15:36:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557723658] [2023-12-09 15:36:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557723658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:36:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226054547] [2023-12-09 15:36:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:57,374 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:36:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:36:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:36:57,375 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:57,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 311 transitions, 2578 flow. Second operand has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:57,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:57,566 INFO L124 PetriNetUnfolderBase]: 314/1542 cut-off events. [2023-12-09 15:36:57,567 INFO L125 PetriNetUnfolderBase]: For 5287/6007 co-relation queries the response was YES. [2023-12-09 15:36:57,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 1542 events. 314/1542 cut-off events. For 5287/6007 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10863 event pairs, 73 based on Foata normal form. 22/1412 useless extension candidates. Maximal degree in co-relation 4456. Up to 301 conditions per place. [2023-12-09 15:36:57,577 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 115 selfloop transitions, 13 changer transitions 37/317 dead transitions. [2023-12-09 15:36:57,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 317 transitions, 2953 flow [2023-12-09 15:36:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:36:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:36:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 895 transitions. [2023-12-09 15:36:57,579 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8622350674373795 [2023-12-09 15:36:57,579 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 895 transitions. [2023-12-09 15:36:57,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 895 transitions. [2023-12-09 15:36:57,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:57,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 895 transitions. [2023-12-09 15:36:57,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,582 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,584 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 48 predicate places. [2023-12-09 15:36:57,584 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 317 transitions, 2953 flow [2023-12-09 15:36:57,584 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,584 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:57,584 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:57,584 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:36:57,585 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 528282952, now seen corresponding path program 2 times [2023-12-09 15:36:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339671204] [2023-12-09 15:36:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339671204] [2023-12-09 15:36:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339671204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:36:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10815575] [2023-12-09 15:36:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:57,686 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:36:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:36:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:36:57,687 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2023-12-09 15:36:57,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 317 transitions, 2953 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:57,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2023-12-09 15:36:57,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:57,904 INFO L124 PetriNetUnfolderBase]: 364/1844 cut-off events. [2023-12-09 15:36:57,905 INFO L125 PetriNetUnfolderBase]: For 6768/7327 co-relation queries the response was YES. [2023-12-09 15:36:57,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 1844 events. 364/1844 cut-off events. For 6768/7327 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13825 event pairs, 85 based on Foata normal form. 9/1677 useless extension candidates. Maximal degree in co-relation 4995. Up to 318 conditions per place. [2023-12-09 15:36:57,916 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 99 selfloop transitions, 12 changer transitions 37/328 dead transitions. [2023-12-09 15:36:57,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 328 transitions, 3367 flow [2023-12-09 15:36:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:36:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:36:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2023-12-09 15:36:57,919 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8901734104046243 [2023-12-09 15:36:57,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 616 transitions. [2023-12-09 15:36:57,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 616 transitions. [2023-12-09 15:36:57,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:57,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 616 transitions. [2023-12-09 15:36:57,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,922 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 51 predicate places. [2023-12-09 15:36:57,922 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 328 transitions, 3367 flow [2023-12-09 15:36:57,922 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:57,922 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:57,922 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:57,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:36:57,923 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:57,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1736136520, now seen corresponding path program 3 times [2023-12-09 15:36:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249452348] [2023-12-09 15:36:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249452348] [2023-12-09 15:36:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249452348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:58,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:36:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938529465] [2023-12-09 15:36:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:58,062 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:36:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:36:58,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:36:58,063 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-12-09 15:36:58,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 328 transitions, 3367 flow. Second operand has 6 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:58,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:58,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-12-09 15:36:58,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:58,268 INFO L124 PetriNetUnfolderBase]: 361/1817 cut-off events. [2023-12-09 15:36:58,269 INFO L125 PetriNetUnfolderBase]: For 8268/9321 co-relation queries the response was YES. [2023-12-09 15:36:58,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6753 conditions, 1817 events. 361/1817 cut-off events. For 8268/9321 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13433 event pairs, 81 based on Foata normal form. 47/1693 useless extension candidates. Maximal degree in co-relation 5507. Up to 319 conditions per place. [2023-12-09 15:36:58,284 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 115 selfloop transitions, 26 changer transitions 36/323 dead transitions. [2023-12-09 15:36:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 323 transitions, 3675 flow [2023-12-09 15:36:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:36:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:36:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 907 transitions. [2023-12-09 15:36:58,287 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.873795761078998 [2023-12-09 15:36:58,287 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 907 transitions. [2023-12-09 15:36:58,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 907 transitions. [2023-12-09 15:36:58,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:58,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 907 transitions. [2023-12-09 15:36:58,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.16666666666666) internal successors, (907), 6 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:58,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:58,291 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:58,291 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 55 predicate places. [2023-12-09 15:36:58,291 INFO L500 AbstractCegarLoop]: Abstraction has has 210 places, 323 transitions, 3675 flow [2023-12-09 15:36:58,292 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:58,292 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:58,292 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:36:58,292 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:36:58,292 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:58,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1363634026, now seen corresponding path program 1 times [2023-12-09 15:36:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348435244] [2023-12-09 15:36:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:36:58,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:58,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348435244] [2023-12-09 15:36:58,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348435244] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:58,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444027809] [2023-12-09 15:36:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:58,488 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-12-09 15:36:58,512 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-12-09 15:36:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:58,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-09 15:36:58,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:36:59,152 INFO L378 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 15 treesize of output 7 [2023-12-09 15:36:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:59,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:36:59,555 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:36:59,555 INFO L378 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 19 treesize of output 7 [2023-12-09 15:37: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-12-09 15:37:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444027809] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:37:00,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:37:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 18] total 38 [2023-12-09 15:37:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615396294] [2023-12-09 15:37:00,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:37:00,196 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-09 15:37:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:00,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-09 15:37:00,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2023-12-09 15:37:00,200 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 173 [2023-12-09 15:37:00,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 323 transitions, 3675 flow. Second operand has 38 states, 38 states have (on average 61.89473684210526) internal successors, (2352), 38 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-12-09 15:37:00,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:00,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 173 [2023-12-09 15:37:00,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:37:08,742 INFO L124 PetriNetUnfolderBase]: 9392/19380 cut-off events. [2023-12-09 15:37:08,742 INFO L125 PetriNetUnfolderBase]: For 91647/92406 co-relation queries the response was YES. [2023-12-09 15:37:08,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75869 conditions, 19380 events. 9392/19380 cut-off events. For 91647/92406 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 170606 event pairs, 483 based on Foata normal form. 60/18124 useless extension candidates. Maximal degree in co-relation 57995. Up to 3081 conditions per place. [2023-12-09 15:37:08,872 INFO L140 encePairwiseOnDemand]: 116/173 looper letters, 795 selfloop transitions, 358 changer transitions 638/1862 dead transitions. [2023-12-09 15:37:08,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1862 transitions, 19443 flow [2023-12-09 15:37:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-12-09 15:37:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2023-12-09 15:37:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 11345 transitions. [2023-12-09 15:37:08,887 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3623095838789001 [2023-12-09 15:37:08,887 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 11345 transitions. [2023-12-09 15:37:08,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 11345 transitions. [2023-12-09 15:37:08,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:37:08,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 11345 transitions. [2023-12-09 15:37:08,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 62.67955801104972) internal successors, (11345), 181 states have internal predecessors, (11345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:08,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 173.0) internal successors, (31486), 182 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:08,947 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 173.0) internal successors, (31486), 182 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:08,948 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 235 predicate places. [2023-12-09 15:37:08,948 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 1862 transitions, 19443 flow [2023-12-09 15:37:08,949 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 61.89473684210526) internal successors, (2352), 38 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-12-09 15:37:08,949 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:37:08,949 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:37:08,954 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-12-09 15:37:09,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:37:09,154 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:37:09,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:37:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -267058476, now seen corresponding path program 2 times [2023-12-09 15:37:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:37:09,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872468085] [2023-12-09 15:37:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:37:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:37:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:37:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:37:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872468085] [2023-12-09 15:37:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872468085] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:37:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252706761] [2023-12-09 15:37:10,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:37:10,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:37:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:37:10,686 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-12-09 15:37:10,699 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-12-09 15:37:10,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:37:10,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:37:10,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-09 15:37:10,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:37:11,235 INFO L378 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 15 treesize of output 1 [2023-12-09 15:37:11,685 INFO L378 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 8 treesize of output 1 [2023-12-09 15:37:11,761 INFO L378 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 8 treesize of output 1 [2023-12-09 15:37:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:37:12,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:37:13,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:37:13,511 INFO L378 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 168 treesize of output 108 [2023-12-09 15:37:13,575 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2023-12-09 15:37:13,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 608 treesize of output 587 [2023-12-09 15:37:13,627 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-12-09 15:37:13,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 137 [2023-12-09 15:37:13,769 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-12-09 15:37:13,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 140 [2023-12-09 15:37:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252706761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:37:14,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:37:14,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 74 [2023-12-09 15:37:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906129864] [2023-12-09 15:37:14,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:37:14,371 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-09 15:37:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-09 15:37:14,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=4451, Unknown=25, NotChecked=0, Total=5402 [2023-12-09 15:37:14,377 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 173 [2023-12-09 15:37:14,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1862 transitions, 19443 flow. Second operand has 74 states, 74 states have (on average 57.37837837837838) internal successors, (4246), 74 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:14,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 173 [2023-12-09 15:37:14,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:37:16,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse4 (select |c_#memory_int| c_~f~0.base)) (.cse3 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_205 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_205) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse2) 4))) (select .cse1 (+ (* .cse0 4) c_~f~0.offset))) (< c_~size~0 (+ .cse0 1)))))) (= c_~f~0.offset 0) (= c_~x1~0 (select .cse4 0)) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_205) c_~f~0.base))) (let ((.cse5 (select .cse6 .cse3))) (or (< c_~size~0 (+ .cse5 1)) (< .cse5 0) (= (select .cse6 (+ (* .cse5 4) c_~f~0.offset)) (select .cse6 (+ c_~f~0.offset (* (select .cse6 .cse2) 4)))))))) (= c_~x2~0 0) (let ((.cse7 (select .cse4 .cse3))) (or (< .cse7 0) (< c_~size~0 (+ .cse7 1)) (= (select .cse4 (+ c_~f~0.offset (* (select .cse4 .cse2) 4))) (select .cse4 (+ (* .cse7 4) c_~f~0.offset))))))) is different from false [2023-12-09 15:37:30,410 INFO L124 PetriNetUnfolderBase]: 20972/42661 cut-off events. [2023-12-09 15:37:30,411 INFO L125 PetriNetUnfolderBase]: For 215345/218909 co-relation queries the response was YES. [2023-12-09 15:37:30,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190534 conditions, 42661 events. 20972/42661 cut-off events. For 215345/218909 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 419338 event pairs, 1179 based on Foata normal form. 205/39901 useless extension candidates. Maximal degree in co-relation 153926. Up to 8584 conditions per place. [2023-12-09 15:37:30,751 INFO L140 encePairwiseOnDemand]: 116/173 looper letters, 1716 selfloop transitions, 697 changer transitions 1639/4487 dead transitions. [2023-12-09 15:37:30,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 4487 transitions, 42952 flow [2023-12-09 15:37:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2023-12-09 15:37:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2023-12-09 15:37:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 9765 transitions. [2023-12-09 15:37:30,914 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3484264611432242 [2023-12-09 15:37:30,914 INFO L72 ComplementDD]: Start complementDD. Operand 162 states and 9765 transitions. [2023-12-09 15:37:30,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 9765 transitions. [2023-12-09 15:37:30,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:37:30,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 162 states and 9765 transitions. [2023-12-09 15:37:30,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 163 states, 162 states have (on average 60.27777777777778) internal successors, (9765), 162 states have internal predecessors, (9765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:30,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 163 states, 163 states have (on average 173.0) internal successors, (28199), 163 states have internal predecessors, (28199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:30,972 INFO L81 ComplementDD]: Finished complementDD. Result has 163 states, 163 states have (on average 173.0) internal successors, (28199), 163 states have internal predecessors, (28199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:30,973 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 396 predicate places. [2023-12-09 15:37:30,973 INFO L500 AbstractCegarLoop]: Abstraction has has 551 places, 4487 transitions, 42952 flow [2023-12-09 15:37:30,974 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 57.37837837837838) internal successors, (4246), 74 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:30,974 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:37:30,974 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:37:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:37:31,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:37:31,180 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:37:31,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:37:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -659910688, now seen corresponding path program 3 times [2023-12-09 15:37:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:37:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200412552] [2023-12-09 15:37:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:37:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:37:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:37:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:37:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200412552] [2023-12-09 15:37:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200412552] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:37:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686723271] [2023-12-09 15:37:32,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:37:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:37:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:37:32,498 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-12-09 15:37:32,499 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-12-09 15:37:32,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 15:37:32,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:37:32,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-09 15:37:32,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:37:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:33,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:37:34,179 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2023-12-09 15:37:34,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2023-12-09 15:37:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686723271] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:37:34,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:37:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 22] total 66 [2023-12-09 15:37:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445444271] [2023-12-09 15:37:34,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:37:34,550 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-09 15:37:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-09 15:37:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=3737, Unknown=0, NotChecked=0, Total=4290 [2023-12-09 15:37:34,554 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 173 [2023-12-09 15:37:34,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 4487 transitions, 42952 flow. Second operand has 66 states, 66 states have (on average 63.803030303030305) internal successors, (4211), 66 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:34,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:34,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 173 [2023-12-09 15:37:34,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:37:47,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 4918#true, 173#(<= 1 ~size~0), 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 95#L37-1true, 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,050 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,050 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,050 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,050 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2483], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 20#L38-1true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 5528#(or (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,054 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,054 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,054 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,054 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 4918#true, 173#(<= 1 ~size~0), 155#L84-1true, 95#L37-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,055 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,055 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,055 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,055 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2483], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 20#L38-1true, 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 5528#(or (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,058 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,058 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,058 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,058 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-12-09 15:37:47,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 21#L50-2true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,749 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,750 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,750 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,750 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 21#L50-2true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:47,751 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,751 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,751 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:47,752 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-12-09 15:37:48,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-12-09 15:37:48,503 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,503 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,503 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,503 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-12-09 15:37:48,504 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,504 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,504 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,504 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 4918#true, 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-12-09 15:37:48,505 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-12-09 15:37:48,505 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:48,505 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-12-09 15:37:50,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3268], [1639#true, thread1Thread1of1ForFork0InUse, 3419#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 4760#(and (or (< ~size~0 (+ ~x2~0 1)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (< ~x2~0 0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 10#L38-4true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 923#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 1645#true, 2360#true]) [2023-12-09 15:37:50,902 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-12-09 15:37:50,902 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:37:50,902 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:37:50,902 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:37:51,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 128#L37-3true]) [2023-12-09 15:37:51,560 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2023-12-09 15:37:51,560 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:37:51,560 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:37:51,560 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:37:52,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 52#L63-2true, 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:52,226 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2023-12-09 15:37:52,226 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-12-09 15:37:52,226 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-12-09 15:37:52,226 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-12-09 15:37:52,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 156#L64true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-12-09 15:37:52,909 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,910 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,910 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,910 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L64-->L64-1: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem5#1_1| (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_1 4) v_~f~0.offset_2))) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_1, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_1, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem5#1][3396], [4233#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))), 1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 6077#(and (= ~x1~0 0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (= 0 |thread2Thread1of1ForFork1_#t~mem5#1|)) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 1645#true, 61#L64-1true, 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-12-09 15:37:52,910 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,910 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,911 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:52,911 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-12-09 15:37:58,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5366], [114#L38-1true, 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 3531#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~x2~0 0))) (= (select (select |#memory_int| ~f~0.base) 0) ~x1~0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~x2~0 0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 4276#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true]) [2023-12-09 15:37:58,462 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-12-09 15:37:58,462 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-12-09 15:37:58,462 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-12-09 15:37:58,462 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-12-09 15:37:58,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5364], [3557#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 26#L37-1true, 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true]) [2023-12-09 15:37:58,954 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2023-12-09 15:37:58,954 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-12-09 15:37:58,954 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-12-09 15:37:58,954 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-12-09 15:37:59,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 82#L60-2true]) [2023-12-09 15:37:59,267 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-12-09 15:37:59,267 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-12-09 15:37:59,267 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-12-09 15:37:59,267 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-12-09 15:37:59,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5369], [3561#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 82#L60-2true]) [2023-12-09 15:37:59,472 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2023-12-09 15:37:59,472 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-12-09 15:37:59,473 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-12-09 15:37:59,473 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-12-09 15:37:59,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][5494], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3553#(and (= ~x1~0 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 38#L61-1true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 11#L51true, 4945#(and (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0))]) [2023-12-09 15:37:59,488 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,488 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,489 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,489 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-12-09 15:37:59,796 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-12-09 15:37:59,796 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,796 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-12-09 15:37:59,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5495], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 3565#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 126#L61true]) [2023-12-09 15:37:59,988 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2023-12-09 15:37:59,988 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-12-09 15:37:59,988 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-12-09 15:37:59,988 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-12-09 15:38:11,915 INFO L124 PetriNetUnfolderBase]: 55199/110002 cut-off events. [2023-12-09 15:38:11,915 INFO L125 PetriNetUnfolderBase]: For 527368/536726 co-relation queries the response was YES. [2023-12-09 15:38:12,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511554 conditions, 110002 events. 55199/110002 cut-off events. For 527368/536726 co-relation queries the response was YES. Maximal size of possible extension queue 2286. Compared 1207472 event pairs, 5092 based on Foata normal form. 523/101451 useless extension candidates. Maximal degree in co-relation 416830. Up to 34214 conditions per place. [2023-12-09 15:38:12,979 INFO L140 encePairwiseOnDemand]: 126/173 looper letters, 4092 selfloop transitions, 1336 changer transitions 2111/9014 dead transitions. [2023-12-09 15:38:12,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 9014 transitions, 94866 flow [2023-12-09 15:38:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2023-12-09 15:38:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2023-12-09 15:38:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 12140 transitions. [2023-12-09 15:38:12,988 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3834612590416627 [2023-12-09 15:38:12,988 INFO L72 ComplementDD]: Start complementDD. Operand 183 states and 12140 transitions. [2023-12-09 15:38:12,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 12140 transitions. [2023-12-09 15:38:12,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:12,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 183 states and 12140 transitions. [2023-12-09 15:38:13,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 184 states, 183 states have (on average 66.33879781420765) internal successors, (12140), 183 states have internal predecessors, (12140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:13,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 184 states, 184 states have (on average 173.0) internal successors, (31832), 184 states have internal predecessors, (31832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:13,034 INFO L81 ComplementDD]: Finished complementDD. Result has 184 states, 184 states have (on average 173.0) internal successors, (31832), 184 states have internal predecessors, (31832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:13,034 INFO L308 CegarLoopForPetriNet]: 155 programPoint places, 578 predicate places. [2023-12-09 15:38:13,034 INFO L500 AbstractCegarLoop]: Abstraction has has 733 places, 9014 transitions, 94866 flow [2023-12-09 15:38:13,035 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 63.803030303030305) internal successors, (4211), 66 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:13,035 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:13,035 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:38:13,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:38:13,239 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:13,240 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:13,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1555091038, now seen corresponding path program 4 times [2023-12-09 15:38:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240816442] [2023-12-09 15:38:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240816442] [2023-12-09 15:38:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240816442] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717317836] [2023-12-09 15:38:14,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:38:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:14,453 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-12-09 15:38:14,455 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-12-09 15:38:14,555 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:38:14,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:14,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-09 15:38:14,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:15,099 INFO L378 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 15 treesize of output 7 [2023-12-09 15:38:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:15,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:15,288 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:38:15,288 INFO L378 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 19 treesize of output 7 [2023-12-09 15:38:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717317836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:15,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 55 [2023-12-09 15:38:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440816887] [2023-12-09 15:38:15,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:15,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-09 15:38:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-09 15:38:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2023-12-09 15:38:15,739 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 173 [2023-12-09 15:38:15,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 9014 transitions, 94866 flow. Second operand has 55 states, 55 states have (on average 62.21818181818182) internal successors, (3422), 55 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:15,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:15,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 173 [2023-12-09 15:38:15,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:40:44,511 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-12-09 15:40:44,511 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:40:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2023-12-09 15:40:45,444 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:40:45,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:40:45,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-12-09 15:40:45,648 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:45,648 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 58/173 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 911235 conditions, 172265 events (89859/172264 cut-off events. For 887701/906038 co-relation queries the response was YES. Maximal size of possible extension queue 4148. Compared 2004820 event pairs, 5978 based on Foata normal form. 618/162115 useless extension candidates. Maximal degree in co-relation 749853. Up to 57049 conditions per place.). [2023-12-09 15:40:45,649 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:40:45,649 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:40:45,650 INFO L457 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1] [2023-12-09 15:40:45,652 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:40:45,652 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:40:45,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:40:45 BasicIcfg [2023-12-09 15:40:45,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:40:45,654 INFO L158 Benchmark]: Toolchain (without parser) took 233753.37ms. Allocated memory was 211.8MB in the beginning and 6.4GB in the end (delta: 6.1GB). Free memory was 147.9MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.38ms. Allocated memory is still 211.8MB. Free memory was 147.9MB in the beginning and 136.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.87ms. Allocated memory is still 211.8MB. Free memory was 136.0MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 211.8MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: RCFGBuilder took 336.49ms. Allocated memory was 211.8MB in the beginning and 262.1MB in the end (delta: 50.3MB). Free memory was 132.4MB in the beginning and 216.6MB in the end (delta: -84.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2023-12-09 15:40:45,655 INFO L158 Benchmark]: TraceAbstraction took 233194.36ms. Allocated memory was 262.1MB in the beginning and 6.4GB in the end (delta: 6.1GB). Free memory was 216.1MB in the beginning and 3.6GB in the end (delta: -3.3GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-09 15:40:45,656 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 211.8MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.38ms. Allocated memory is still 211.8MB. Free memory was 147.9MB in the beginning and 136.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.87ms. Allocated memory is still 211.8MB. Free memory was 136.0MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 211.8MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 336.49ms. Allocated memory was 211.8MB in the beginning and 262.1MB in the end (delta: 50.3MB). Free memory was 132.4MB in the beginning and 216.6MB in the end (delta: -84.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * TraceAbstraction took 233194.36ms. Allocated memory was 262.1MB in the beginning and 6.4GB in the end (delta: 6.1GB). Free memory was 216.1MB in the beginning and 3.6GB in the end (delta: -3.3GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 58/173 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 911235 conditions, 172265 events (89859/172264 cut-off events. For 887701/906038 co-relation queries the response was YES. Maximal size of possible extension queue 4148. Compared 2004820 event pairs, 5978 based on Foata normal form. 618/162115 useless extension candidates. Maximal degree in co-relation 749853. Up to 57049 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 58/173 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 911235 conditions, 172265 events (89859/172264 cut-off events. For 887701/906038 co-relation queries the response was YES. Maximal size of possible extension queue 4148. Compared 2004820 event pairs, 5978 based on Foata normal form. 618/162115 useless extension candidates. Maximal degree in co-relation 749853. Up to 57049 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 58/173 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 911235 conditions, 172265 events (89859/172264 cut-off events. For 887701/906038 co-relation queries the response was YES. Maximal size of possible extension queue 4148. Compared 2004820 event pairs, 5978 based on Foata normal form. 618/162115 useless extension candidates. Maximal degree in co-relation 749853. Up to 57049 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 locations, 3 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: 233.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 215.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 8807 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8807 mSDsluCounter, 19218 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 865 IncrementalHoareTripleChecker+Unchecked, 18204 mSDsCounter, 622 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27857 IncrementalHoareTripleChecker+Invalid, 29416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 622 mSolverCounterUnsat, 1014 mSDtfsCounter, 27857 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2846 GetRequests, 1804 SyntacticMatches, 8 SemanticMatches, 1034 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92493 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94866occurred in iteration=13, InterpolantAutomatonStates: 592, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2758 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3695 ConstructedInterpolants, 49 QuantifiedInterpolants, 26101 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1977 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 41/191 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