/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 08:26:46,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 08:26:46,591 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-11-30 08:26:46,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 08:26:46,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 08:26:46,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 08:26:46,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 08:26:46,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 08:26:46,612 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 08:26:46,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 08:26:46,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 08:26:46,613 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 08:26:46,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 08:26:46,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 08:26:46,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 08:26:46,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 08:26:46,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 08:26:46,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 08:26:46,615 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 08:26:46,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 08:26:46,616 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 08:26:46,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 08:26:46,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 08:26:46,620 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 08:26:46,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 08:26:46,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:26:46,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 08:26:46,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 08:26:46,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 08:26:46,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 08:26:46,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 08:26:46,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 08:26:46,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 08:26:46,625 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-11-30 08:26:46,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 08:26:46,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 08:26:46,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 08:26:46,866 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 08:26:46,866 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 08:26:46,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2023-11-30 08:26:48,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 08:26:48,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 08:26:48,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2023-11-30 08:26:48,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9170cf8b5/7c549fca65324d06a233c4914924c9fb/FLAG768aa8d30 [2023-11-30 08:26:48,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9170cf8b5/7c549fca65324d06a233c4914924c9fb [2023-11-30 08:26:48,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 08:26:48,292 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 08:26:48,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 08:26:48,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 08:26:48,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 08:26:48,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc57a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48, skipping insertion in model container [2023-11-30 08:26:48,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,326 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 08:26:48,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:26:48,533 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 08:26:48,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 08:26:48,592 INFO L206 MainTranslator]: Completed translation [2023-11-30 08:26:48,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48 WrapperNode [2023-11-30 08:26:48,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 08:26:48,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 08:26:48,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 08:26:48,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 08:26:48,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,655 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 247 [2023-11-30 08:26:48,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 08:26:48,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 08:26:48,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 08:26:48,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 08:26:48,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 08:26:48,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 08:26:48,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 08:26:48,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 08:26:48,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (1/1) ... [2023-11-30 08:26:48,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 08:26:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:48,721 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-11-30 08:26:48,736 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-11-30 08:26:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 08:26:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 08:26:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 08:26:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 08:26:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 08:26:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 08:26:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 08:26:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 08:26:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 08:26:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 08:26:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 08:26:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 08:26:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 08:26:48,755 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 08:26:48,873 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 08:26:48,877 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 08:26:49,230 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 08:26:49,248 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 08:26:49,249 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 08:26:49,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:26:49 BoogieIcfgContainer [2023-11-30 08:26:49,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 08:26:49,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 08:26:49,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 08:26:49,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 08:26:49,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 08:26:48" (1/3) ... [2023-11-30 08:26:49,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bd87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:26:49, skipping insertion in model container [2023-11-30 08:26:49,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 08:26:48" (2/3) ... [2023-11-30 08:26:49,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bd87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 08:26:49, skipping insertion in model container [2023-11-30 08:26:49,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 08:26:49" (3/3) ... [2023-11-30 08:26:49,259 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2023-11-30 08:26:49,273 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 08:26:49,273 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-30 08:26:49,273 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 08:26:49,376 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 08:26:49,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 332 transitions, 678 flow [2023-11-30 08:26:49,526 INFO L124 PetriNetUnfolderBase]: 25/330 cut-off events. [2023-11-30 08:26:49,527 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 08:26:49,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 330 events. 25/330 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 641 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 206. Up to 3 conditions per place. [2023-11-30 08:26:49,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 332 transitions, 678 flow [2023-11-30 08:26:49,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 292 transitions, 593 flow [2023-11-30 08:26:49,557 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 08:26:49,563 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;@236c1c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 08:26:49,565 INFO L363 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-30 08:26:49,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 08:26:49,585 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2023-11-30 08:26:49,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 08:26:49,585 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:49,586 INFO L232 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] [2023-11-30 08:26:49,586 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:49,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 171850883, now seen corresponding path program 1 times [2023-11-30 08:26:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579020636] [2023-11-30 08:26:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579020636] [2023-11-30 08:26:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579020636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:26:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:26:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643999962] [2023-11-30 08:26:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:49,909 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:26:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:26:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:26:49,948 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 332 [2023-11-30 08:26:49,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 292 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 285.5) internal successors, (1142), 4 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:49,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:49,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 332 [2023-11-30 08:26:49,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:50,138 INFO L124 PetriNetUnfolderBase]: 12/304 cut-off events. [2023-11-30 08:26:50,139 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-30 08:26:50,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 304 events. 12/304 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 543 event pairs, 0 based on Foata normal form. 12/272 useless extension candidates. Maximal degree in co-relation 268. Up to 34 conditions per place. [2023-11-30 08:26:50,147 INFO L140 encePairwiseOnDemand]: 306/332 looper letters, 39 selfloop transitions, 10 changer transitions 4/298 dead transitions. [2023-11-30 08:26:50,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 703 flow [2023-11-30 08:26:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:26:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:26:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1487 transitions. [2023-11-30 08:26:50,168 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8957831325301204 [2023-11-30 08:26:50,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1487 transitions. [2023-11-30 08:26:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1487 transitions. [2023-11-30 08:26:50,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:50,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1487 transitions. [2023-11-30 08:26:50,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 297.4) internal successors, (1487), 5 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,199 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 4 predicate places. [2023-11-30 08:26:50,199 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 298 transitions, 703 flow [2023-11-30 08:26:50,200 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 285.5) internal successors, (1142), 4 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,201 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:50,201 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 08:26:50,201 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 08:26:50,202 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:50,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1628624079, now seen corresponding path program 1 times [2023-11-30 08:26:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073239133] [2023-11-30 08:26:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073239133] [2023-11-30 08:26:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073239133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:26:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006586843] [2023-11-30 08:26:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:50,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:50,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:50,489 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-11-30 08:26:50,511 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-11-30 08:26:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:50,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 08:26:50,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:26:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:50,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:26:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006586843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:50,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:26:50,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 08:26:50,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56196030] [2023-11-30 08:26:50,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:50,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 08:26:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 08:26:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 08:26:50,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 332 [2023-11-30 08:26:50,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 298 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 286.1666666666667) internal successors, (1717), 6 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:50,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 332 [2023-11-30 08:26:50,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:50,869 INFO L124 PetriNetUnfolderBase]: 12/302 cut-off events. [2023-11-30 08:26:50,869 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-30 08:26:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 302 events. 12/302 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 309. Up to 32 conditions per place. [2023-11-30 08:26:50,873 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 31 selfloop transitions, 16 changer transitions 4/296 dead transitions. [2023-11-30 08:26:50,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 296 transitions, 789 flow [2023-11-30 08:26:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 08:26:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 08:26:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2037 transitions. [2023-11-30 08:26:50,878 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8765060240963856 [2023-11-30 08:26:50,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2037 transitions. [2023-11-30 08:26:50,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2037 transitions. [2023-11-30 08:26:50,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:50,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2037 transitions. [2023-11-30 08:26:50,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,890 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,891 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 8 predicate places. [2023-11-30 08:26:50,891 INFO L500 AbstractCegarLoop]: Abstraction has has 285 places, 296 transitions, 789 flow [2023-11-30 08:26:50,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 286.1666666666667) internal successors, (1717), 6 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:50,892 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:50,892 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:26:50,906 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-11-30 08:26:51,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:51,104 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:51,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1052260492, now seen corresponding path program 1 times [2023-11-30 08:26:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036547171] [2023-11-30 08:26:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036547171] [2023-11-30 08:26:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036547171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:26:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235716994] [2023-11-30 08:26:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:51,228 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-11-30 08:26:51,251 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-11-30 08:26:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:51,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 08:26:51,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:26:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:51,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:26:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235716994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:26:51,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:26:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 08:26:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169701726] [2023-11-30 08:26:51,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:26:51,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 08:26:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 08:26:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 08:26:51,452 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 332 [2023-11-30 08:26:51,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 296 transitions, 789 flow. Second operand has 12 states, 12 states have (on average 286.8333333333333) internal successors, (3442), 12 states have internal predecessors, (3442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:51,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:51,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 332 [2023-11-30 08:26:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:51,724 INFO L124 PetriNetUnfolderBase]: 18/372 cut-off events. [2023-11-30 08:26:51,724 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-30 08:26:51,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 372 events. 18/372 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 886 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 580. Up to 84 conditions per place. [2023-11-30 08:26:51,728 INFO L140 encePairwiseOnDemand]: 318/332 looper letters, 63 selfloop transitions, 36 changer transitions 4/348 dead transitions. [2023-11-30 08:26:51,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 348 transitions, 1299 flow [2023-11-30 08:26:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 08:26:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 08:26:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4081 transitions. [2023-11-30 08:26:51,737 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8780120481927711 [2023-11-30 08:26:51,737 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4081 transitions. [2023-11-30 08:26:51,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4081 transitions. [2023-11-30 08:26:51,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:51,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4081 transitions. [2023-11-30 08:26:51,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 291.5) internal successors, (4081), 14 states have internal predecessors, (4081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:51,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:51,757 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:51,758 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 21 predicate places. [2023-11-30 08:26:51,758 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 348 transitions, 1299 flow [2023-11-30 08:26:51,759 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 286.8333333333333) internal successors, (3442), 12 states have internal predecessors, (3442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:51,759 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:51,760 INFO L232 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] [2023-11-30 08:26:51,771 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-11-30 08:26:51,966 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-30 08:26:51,966 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:51,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash 64521772, now seen corresponding path program 1 times [2023-11-30 08:26:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440576335] [2023-11-30 08:26:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:52,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440576335] [2023-11-30 08:26:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440576335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:52,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:26:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 08:26:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25315058] [2023-11-30 08:26:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:52,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 08:26:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 08:26:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-30 08:26:52,213 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 332 [2023-11-30 08:26:52,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 348 transitions, 1299 flow. Second operand has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:52,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 332 [2023-11-30 08:26:52,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:52,562 INFO L124 PetriNetUnfolderBase]: 125/1287 cut-off events. [2023-11-30 08:26:52,562 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-11-30 08:26:52,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1287 events. 125/1287 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8285 event pairs, 58 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1028. Up to 141 conditions per place. [2023-11-30 08:26:52,572 INFO L140 encePairwiseOnDemand]: 315/332 looper letters, 94 selfloop transitions, 18 changer transitions 4/357 dead transitions. [2023-11-30 08:26:52,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 357 transitions, 1565 flow [2023-11-30 08:26:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 08:26:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 08:26:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3179 transitions. [2023-11-30 08:26:52,579 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7979417670682731 [2023-11-30 08:26:52,579 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3179 transitions. [2023-11-30 08:26:52,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3179 transitions. [2023-11-30 08:26:52,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:52,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3179 transitions. [2023-11-30 08:26:52,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 264.9166666666667) internal successors, (3179), 12 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 332.0) internal successors, (4316), 13 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,595 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 332.0) internal successors, (4316), 13 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,596 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 32 predicate places. [2023-11-30 08:26:52,597 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 357 transitions, 1565 flow [2023-11-30 08:26:52,598 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,598 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:52,598 INFO L232 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] [2023-11-30 08:26:52,598 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 08:26:52,598 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:52,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2000175736, now seen corresponding path program 1 times [2023-11-30 08:26:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378061930] [2023-11-30 08:26:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378061930] [2023-11-30 08:26:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378061930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:26:52,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-30 08:26:52,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626689965] [2023-11-30 08:26:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:52,861 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 08:26:52,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:52,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 08:26:52,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-30 08:26:52,895 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 332 [2023-11-30 08:26:52,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 357 transitions, 1565 flow. Second operand has 12 states, 12 states have (on average 223.08333333333334) internal successors, (2677), 12 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:52,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:52,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 332 [2023-11-30 08:26:52,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:53,536 INFO L124 PetriNetUnfolderBase]: 220/2299 cut-off events. [2023-11-30 08:26:53,537 INFO L125 PetriNetUnfolderBase]: For 1025/1059 co-relation queries the response was YES. [2023-11-30 08:26:53,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 2299 events. 220/2299 cut-off events. For 1025/1059 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18366 event pairs, 92 based on Foata normal form. 0/1876 useless extension candidates. Maximal degree in co-relation 1296. Up to 245 conditions per place. [2023-11-30 08:26:53,556 INFO L140 encePairwiseOnDemand]: 307/332 looper letters, 189 selfloop transitions, 28 changer transitions 6/448 dead transitions. [2023-11-30 08:26:53,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 448 transitions, 2624 flow [2023-11-30 08:26:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 08:26:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 08:26:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4091 transitions. [2023-11-30 08:26:53,565 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6845716198125836 [2023-11-30 08:26:53,565 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4091 transitions. [2023-11-30 08:26:53,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4091 transitions. [2023-11-30 08:26:53,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:53,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4091 transitions. [2023-11-30 08:26:53,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.27777777777777) internal successors, (4091), 18 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:53,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 332.0) internal successors, (6308), 19 states have internal predecessors, (6308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:53,584 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 332.0) internal successors, (6308), 19 states have internal predecessors, (6308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:53,585 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 49 predicate places. [2023-11-30 08:26:53,585 INFO L500 AbstractCegarLoop]: Abstraction has has 326 places, 448 transitions, 2624 flow [2023-11-30 08:26:53,586 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 223.08333333333334) internal successors, (2677), 12 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:53,586 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:53,586 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 08:26:53,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 08:26:53,587 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:53,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1879411440, now seen corresponding path program 2 times [2023-11-30 08:26:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013643121] [2023-11-30 08:26:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013643121] [2023-11-30 08:26:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013643121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:26:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863932654] [2023-11-30 08:26:53,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 08:26:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:53,753 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-11-30 08:26:53,756 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-11-30 08:26:53,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 08:26:53,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 08:26:53,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 08:26:53,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:26:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 08:26:53,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:26:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 08:26:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863932654] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:26:54,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:26:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2023-11-30 08:26:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836469131] [2023-11-30 08:26:54,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:26:54,100 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 08:26:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:54,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 08:26:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-11-30 08:26:54,106 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 332 [2023-11-30 08:26:54,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 448 transitions, 2624 flow. Second operand has 18 states, 18 states have (on average 254.77777777777777) internal successors, (4586), 18 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:54,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:54,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 332 [2023-11-30 08:26:54,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:55,272 INFO L124 PetriNetUnfolderBase]: 226/2368 cut-off events. [2023-11-30 08:26:55,272 INFO L125 PetriNetUnfolderBase]: For 1613/1681 co-relation queries the response was YES. [2023-11-30 08:26:55,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 2368 events. 226/2368 cut-off events. For 1613/1681 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 19109 event pairs, 92 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 1828. Up to 306 conditions per place. [2023-11-30 08:26:55,294 INFO L140 encePairwiseOnDemand]: 309/332 looper letters, 167 selfloop transitions, 96 changer transitions 6/492 dead transitions. [2023-11-30 08:26:55,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 492 transitions, 3642 flow [2023-11-30 08:26:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-30 08:26:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-30 08:26:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 12465 transitions. [2023-11-30 08:26:55,320 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7662281780181952 [2023-11-30 08:26:55,320 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 12465 transitions. [2023-11-30 08:26:55,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 12465 transitions. [2023-11-30 08:26:55,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:55,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 12465 transitions. [2023-11-30 08:26:55,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 254.3877551020408) internal successors, (12465), 49 states have internal predecessors, (12465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:55,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 332.0) internal successors, (16600), 50 states have internal predecessors, (16600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:55,375 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 332.0) internal successors, (16600), 50 states have internal predecessors, (16600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:55,375 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 96 predicate places. [2023-11-30 08:26:55,376 INFO L500 AbstractCegarLoop]: Abstraction has has 373 places, 492 transitions, 3642 flow [2023-11-30 08:26:55,377 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 254.77777777777777) internal successors, (4586), 18 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:55,377 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:55,377 INFO L232 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] [2023-11-30 08:26:55,387 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-11-30 08:26:55,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:55,583 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:55,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1912885652, now seen corresponding path program 1 times [2023-11-30 08:26:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426719923] [2023-11-30 08:26:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426719923] [2023-11-30 08:26:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426719923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:26:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-30 08:26:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095854016] [2023-11-30 08:26:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:55,819 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 08:26:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 08:26:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-30 08:26:55,823 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 332 [2023-11-30 08:26:55,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 492 transitions, 3642 flow. Second operand has 12 states, 12 states have (on average 223.16666666666666) internal successors, (2678), 12 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:55,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:55,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 332 [2023-11-30 08:26:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:56,616 INFO L124 PetriNetUnfolderBase]: 383/3992 cut-off events. [2023-11-30 08:26:56,617 INFO L125 PetriNetUnfolderBase]: For 2751/2980 co-relation queries the response was YES. [2023-11-30 08:26:56,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 3992 events. 383/3992 cut-off events. For 2751/2980 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 38381 event pairs, 135 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 2228. Up to 466 conditions per place. [2023-11-30 08:26:56,650 INFO L140 encePairwiseOnDemand]: 308/332 looper letters, 234 selfloop transitions, 43 changer transitions 6/517 dead transitions. [2023-11-30 08:26:56,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 517 transitions, 4444 flow [2023-11-30 08:26:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 08:26:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-30 08:26:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4260 transitions. [2023-11-30 08:26:56,657 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6753329105897273 [2023-11-30 08:26:56,657 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4260 transitions. [2023-11-30 08:26:56,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4260 transitions. [2023-11-30 08:26:56,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:56,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4260 transitions. [2023-11-30 08:26:56,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 224.21052631578948) internal successors, (4260), 19 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:56,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 332.0) internal successors, (6640), 20 states have internal predecessors, (6640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:56,673 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 332.0) internal successors, (6640), 20 states have internal predecessors, (6640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:56,674 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 114 predicate places. [2023-11-30 08:26:56,674 INFO L500 AbstractCegarLoop]: Abstraction has has 391 places, 517 transitions, 4444 flow [2023-11-30 08:26:56,675 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 223.16666666666666) internal successors, (2678), 12 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:56,675 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:56,675 INFO L232 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-11-30 08:26:56,675 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 08:26:56,676 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:56,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1842915953, now seen corresponding path program 1 times [2023-11-30 08:26:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437325249] [2023-11-30 08:26:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:56,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437325249] [2023-11-30 08:26:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437325249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:26:56,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897594219] [2023-11-30 08:26:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:56,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:56,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:56,953 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-11-30 08:26:56,975 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-11-30 08:26:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:57,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 08:26:57,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:26:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:26:57,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:26:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897594219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:26:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2023-11-30 08:26:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941444634] [2023-11-30 08:26:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:57,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 08:26:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 08:26:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2023-11-30 08:26:57,411 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 332 [2023-11-30 08:26:57,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 517 transitions, 4444 flow. Second operand has 9 states, 9 states have (on average 229.44444444444446) internal successors, (2065), 9 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:57,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:57,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 332 [2023-11-30 08:26:57,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:58,144 INFO L124 PetriNetUnfolderBase]: 353/3730 cut-off events. [2023-11-30 08:26:58,145 INFO L125 PetriNetUnfolderBase]: For 3064/3260 co-relation queries the response was YES. [2023-11-30 08:26:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 3730 events. 353/3730 cut-off events. For 3064/3260 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 34996 event pairs, 132 based on Foata normal form. 0/3055 useless extension candidates. Maximal degree in co-relation 2362. Up to 426 conditions per place. [2023-11-30 08:26:58,173 INFO L140 encePairwiseOnDemand]: 306/332 looper letters, 143 selfloop transitions, 34 changer transitions 6/497 dead transitions. [2023-11-30 08:26:58,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 497 transitions, 4592 flow [2023-11-30 08:26:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 08:26:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 08:26:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3429 transitions. [2023-11-30 08:26:58,178 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6885542168674699 [2023-11-30 08:26:58,178 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3429 transitions. [2023-11-30 08:26:58,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3429 transitions. [2023-11-30 08:26:58,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:58,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3429 transitions. [2023-11-30 08:26:58,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 228.6) internal successors, (3429), 15 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:58,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:58,189 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 332.0) internal successors, (5312), 16 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:58,189 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 125 predicate places. [2023-11-30 08:26:58,189 INFO L500 AbstractCegarLoop]: Abstraction has has 402 places, 497 transitions, 4592 flow [2023-11-30 08:26:58,190 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.44444444444446) internal successors, (2065), 9 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:58,190 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:58,190 INFO L232 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-11-30 08:26:58,203 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-11-30 08:26:58,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:58,403 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:58,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1521686248, now seen corresponding path program 1 times [2023-11-30 08:26:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:58,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801341552] [2023-11-30 08:26:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:58,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801341552] [2023-11-30 08:26:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801341552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:26:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:26:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:26:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036715618] [2023-11-30 08:26:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:26:58,462 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:26:58,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:26:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:26:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:26:58,464 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 332 [2023-11-30 08:26:58,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 497 transitions, 4592 flow. Second operand has 4 states, 4 states have (on average 299.75) internal successors, (1199), 4 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:58,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:26:58,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 332 [2023-11-30 08:26:58,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:26:59,320 INFO L124 PetriNetUnfolderBase]: 611/6011 cut-off events. [2023-11-30 08:26:59,320 INFO L125 PetriNetUnfolderBase]: For 8746/9395 co-relation queries the response was YES. [2023-11-30 08:26:59,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12019 conditions, 6011 events. 611/6011 cut-off events. For 8746/9395 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 64540 event pairs, 220 based on Foata normal form. 2/4910 useless extension candidates. Maximal degree in co-relation 2782. Up to 685 conditions per place. [2023-11-30 08:26:59,361 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 65 selfloop transitions, 4 changer transitions 6/532 dead transitions. [2023-11-30 08:26:59,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 532 transitions, 5222 flow [2023-11-30 08:26:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:26:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:26:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1524 transitions. [2023-11-30 08:26:59,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9180722891566265 [2023-11-30 08:26:59,364 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1524 transitions. [2023-11-30 08:26:59,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1524 transitions. [2023-11-30 08:26:59,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:26:59,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1524 transitions. [2023-11-30 08:26:59,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.8) internal successors, (1524), 5 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:59,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:59,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:59,370 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 129 predicate places. [2023-11-30 08:26:59,370 INFO L500 AbstractCegarLoop]: Abstraction has has 406 places, 532 transitions, 5222 flow [2023-11-30 08:26:59,370 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.75) internal successors, (1199), 4 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:26:59,370 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:26:59,370 INFO L232 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] [2023-11-30 08:26:59,371 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 08:26:59,371 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:26:59,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:26:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2039928404, now seen corresponding path program 1 times [2023-11-30 08:26:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:26:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986218645] [2023-11-30 08:26:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:26:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:26:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:26:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986218645] [2023-11-30 08:26:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986218645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:26:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557507927] [2023-11-30 08:26:59,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:26:59,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:26:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:26:59,644 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-11-30 08:26:59,669 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-11-30 08:26:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:26:59,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 08:26:59,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:27:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:00,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 08:27:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557507927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 08:27:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2023-11-30 08:27:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849911765] [2023-11-30 08:27:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:00,009 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 08:27:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 08:27:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-11-30 08:27:00,012 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 332 [2023-11-30 08:27:00,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 532 transitions, 5222 flow. Second operand has 9 states, 9 states have (on average 229.55555555555554) internal successors, (2066), 9 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:00,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:00,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 332 [2023-11-30 08:27:00,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:01,113 INFO L124 PetriNetUnfolderBase]: 562/5660 cut-off events. [2023-11-30 08:27:01,113 INFO L125 PetriNetUnfolderBase]: For 10025/10799 co-relation queries the response was YES. [2023-11-30 08:27:01,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12032 conditions, 5660 events. 562/5660 cut-off events. For 10025/10799 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 59942 event pairs, 172 based on Foata normal form. 2/4654 useless extension candidates. Maximal degree in co-relation 2920. Up to 627 conditions per place. [2023-11-30 08:27:01,169 INFO L140 encePairwiseOnDemand]: 310/332 looper letters, 161 selfloop transitions, 37 changer transitions 6/527 dead transitions. [2023-11-30 08:27:01,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 527 transitions, 5570 flow [2023-11-30 08:27:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 08:27:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 08:27:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3203 transitions. [2023-11-30 08:27:01,180 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6891135972461274 [2023-11-30 08:27:01,180 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3203 transitions. [2023-11-30 08:27:01,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3203 transitions. [2023-11-30 08:27:01,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:01,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3203 transitions. [2023-11-30 08:27:01,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 228.78571428571428) internal successors, (3203), 14 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:01,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:01,197 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 332.0) internal successors, (4980), 15 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:01,198 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 140 predicate places. [2023-11-30 08:27:01,199 INFO L500 AbstractCegarLoop]: Abstraction has has 417 places, 527 transitions, 5570 flow [2023-11-30 08:27:01,199 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.55555555555554) internal successors, (2066), 9 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:01,199 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:01,199 INFO L232 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] [2023-11-30 08:27:01,208 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-11-30 08:27:01,408 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,SelfDestructingSolverStorable9 [2023-11-30 08:27:01,408 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:01,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 691876173, now seen corresponding path program 1 times [2023-11-30 08:27:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677254672] [2023-11-30 08:27:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:01,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677254672] [2023-11-30 08:27:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677254672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:01,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:27:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658750704] [2023-11-30 08:27:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:01,478 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:27:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:27:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:27:01,480 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 332 [2023-11-30 08:27:01,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 527 transitions, 5570 flow. Second operand has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:01,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:01,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 332 [2023-11-30 08:27:01,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:02,813 INFO L124 PetriNetUnfolderBase]: 921/8925 cut-off events. [2023-11-30 08:27:02,813 INFO L125 PetriNetUnfolderBase]: For 25432/26264 co-relation queries the response was YES. [2023-11-30 08:27:02,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19572 conditions, 8925 events. 921/8925 cut-off events. For 25432/26264 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 106523 event pairs, 320 based on Foata normal form. 10/7403 useless extension candidates. Maximal degree in co-relation 3576. Up to 952 conditions per place. [2023-11-30 08:27:02,921 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 89 selfloop transitions, 4 changer transitions 6/568 dead transitions. [2023-11-30 08:27:02,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 568 transitions, 6486 flow [2023-11-30 08:27:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 08:27:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 08:27:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1523 transitions. [2023-11-30 08:27:02,924 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9174698795180722 [2023-11-30 08:27:02,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1523 transitions. [2023-11-30 08:27:02,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1523 transitions. [2023-11-30 08:27:02,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:02,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1523 transitions. [2023-11-30 08:27:02,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.6) internal successors, (1523), 5 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:02,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:02,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:02,930 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 144 predicate places. [2023-11-30 08:27:02,930 INFO L500 AbstractCegarLoop]: Abstraction has has 421 places, 568 transitions, 6486 flow [2023-11-30 08:27:02,931 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:02,931 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:02,931 INFO L232 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-11-30 08:27:02,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 08:27:02,931 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:02,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash 390272735, now seen corresponding path program 1 times [2023-11-30 08:27:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087195207] [2023-11-30 08:27:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087195207] [2023-11-30 08:27:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087195207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:03,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:27:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423718526] [2023-11-30 08:27:03,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:03,003 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:27:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:27:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:27:03,004 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 332 [2023-11-30 08:27:03,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 568 transitions, 6486 flow. Second operand has 4 states, 4 states have (on average 289.5) internal successors, (1158), 4 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:03,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:03,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 332 [2023-11-30 08:27:03,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:04,374 INFO L124 PetriNetUnfolderBase]: 1165/9231 cut-off events. [2023-11-30 08:27:04,374 INFO L125 PetriNetUnfolderBase]: For 48996/49772 co-relation queries the response was YES. [2023-11-30 08:27:04,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24241 conditions, 9231 events. 1165/9231 cut-off events. For 48996/49772 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 111310 event pairs, 368 based on Foata normal form. 10/7717 useless extension candidates. Maximal degree in co-relation 4355. Up to 1172 conditions per place. [2023-11-30 08:27:04,441 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 101 selfloop transitions, 5 changer transitions 6/594 dead transitions. [2023-11-30 08:27:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 594 transitions, 7150 flow [2023-11-30 08:27:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 08:27:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 08:27:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1194 transitions. [2023-11-30 08:27:04,443 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8990963855421686 [2023-11-30 08:27:04,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1194 transitions. [2023-11-30 08:27:04,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1194 transitions. [2023-11-30 08:27:04,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:04,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1194 transitions. [2023-11-30 08:27:04,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 298.5) internal successors, (1194), 4 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:04,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:04,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:04,448 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 146 predicate places. [2023-11-30 08:27:04,448 INFO L500 AbstractCegarLoop]: Abstraction has has 423 places, 594 transitions, 7150 flow [2023-11-30 08:27:04,448 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 289.5) internal successors, (1158), 4 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:04,448 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:04,449 INFO L232 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] [2023-11-30 08:27:04,449 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 08:27:04,449 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:04,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -786446262, now seen corresponding path program 1 times [2023-11-30 08:27:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225545531] [2023-11-30 08:27:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225545531] [2023-11-30 08:27:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225545531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 08:27:04,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714883607] [2023-11-30 08:27:04,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:04,542 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 08:27:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 08:27:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 08:27:04,544 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 332 [2023-11-30 08:27:04,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 594 transitions, 7150 flow. Second operand has 7 states, 7 states have (on average 263.85714285714283) internal successors, (1847), 7 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:04,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:04,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 332 [2023-11-30 08:27:04,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:06,008 INFO L124 PetriNetUnfolderBase]: 1217/11303 cut-off events. [2023-11-30 08:27:06,008 INFO L125 PetriNetUnfolderBase]: For 38129/38683 co-relation queries the response was YES. [2023-11-30 08:27:06,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25792 conditions, 11303 events. 1217/11303 cut-off events. For 38129/38683 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 139184 event pairs, 392 based on Foata normal form. 8/9380 useless extension candidates. Maximal degree in co-relation 8157. Up to 1046 conditions per place. [2023-11-30 08:27:06,103 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 274 selfloop transitions, 13 changer transitions 14/582 dead transitions. [2023-11-30 08:27:06,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 582 transitions, 7251 flow [2023-11-30 08:27:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 08:27:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 08:27:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2685 transitions. [2023-11-30 08:27:06,107 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8087349397590361 [2023-11-30 08:27:06,107 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2685 transitions. [2023-11-30 08:27:06,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2685 transitions. [2023-11-30 08:27:06,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:06,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2685 transitions. [2023-11-30 08:27:06,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 268.5) internal successors, (2685), 10 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:06,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:06,118 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:06,119 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 155 predicate places. [2023-11-30 08:27:06,119 INFO L500 AbstractCegarLoop]: Abstraction has has 432 places, 582 transitions, 7251 flow [2023-11-30 08:27:06,120 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 263.85714285714283) internal successors, (1847), 7 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:06,120 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:06,120 INFO L232 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] [2023-11-30 08:27:06,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 08:27:06,120 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:06,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash -964537708, now seen corresponding path program 1 times [2023-11-30 08:27:06,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:06,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733683281] [2023-11-30 08:27:06,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:06,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:06,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733683281] [2023-11-30 08:27:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733683281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:27:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421879972] [2023-11-30 08:27:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:06,190 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:27:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:06,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:27:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:27:06,191 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 332 [2023-11-30 08:27:06,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 582 transitions, 7251 flow. Second operand has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:06,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:06,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 332 [2023-11-30 08:27:06,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:08,466 INFO L124 PetriNetUnfolderBase]: 1693/14452 cut-off events. [2023-11-30 08:27:08,467 INFO L125 PetriNetUnfolderBase]: For 88326/88800 co-relation queries the response was YES. [2023-11-30 08:27:08,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38396 conditions, 14452 events. 1693/14452 cut-off events. For 88326/88800 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 189768 event pairs, 520 based on Foata normal form. 1/12106 useless extension candidates. Maximal degree in co-relation 11630. Up to 2068 conditions per place. [2023-11-30 08:27:08,569 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 104 selfloop transitions, 5 changer transitions 14/616 dead transitions. [2023-11-30 08:27:08,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 616 transitions, 8233 flow [2023-11-30 08:27:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 08:27:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 08:27:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1194 transitions. [2023-11-30 08:27:08,571 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8990963855421686 [2023-11-30 08:27:08,571 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1194 transitions. [2023-11-30 08:27:08,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1194 transitions. [2023-11-30 08:27:08,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:08,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1194 transitions. [2023-11-30 08:27:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 298.5) internal successors, (1194), 4 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:08,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:08,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:08,575 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 157 predicate places. [2023-11-30 08:27:08,575 INFO L500 AbstractCegarLoop]: Abstraction has has 434 places, 616 transitions, 8233 flow [2023-11-30 08:27:08,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 289.75) internal successors, (1159), 4 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:08,575 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:08,576 INFO L232 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] [2023-11-30 08:27:08,576 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 08:27:08,576 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:08,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 164103046, now seen corresponding path program 1 times [2023-11-30 08:27:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:08,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180742592] [2023-11-30 08:27:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180742592] [2023-11-30 08:27:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180742592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:08,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:08,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 08:27:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691372911] [2023-11-30 08:27:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:08,679 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 08:27:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 08:27:08,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 08:27:08,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 332 [2023-11-30 08:27:08,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 616 transitions, 8233 flow. Second operand has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:08,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:08,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 332 [2023-11-30 08:27:08,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:10,367 INFO L124 PetriNetUnfolderBase]: 1596/12081 cut-off events. [2023-11-30 08:27:10,367 INFO L125 PetriNetUnfolderBase]: For 82096/82586 co-relation queries the response was YES. [2023-11-30 08:27:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35522 conditions, 12081 events. 1596/12081 cut-off events. For 82096/82586 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 149749 event pairs, 595 based on Foata normal form. 5/10097 useless extension candidates. Maximal degree in co-relation 14242. Up to 1741 conditions per place. [2023-11-30 08:27:10,445 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 225 selfloop transitions, 12 changer transitions 73/601 dead transitions. [2023-11-30 08:27:10,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 601 transitions, 8363 flow [2023-11-30 08:27:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 08:27:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 08:27:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2683 transitions. [2023-11-30 08:27:10,448 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8081325301204819 [2023-11-30 08:27:10,448 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2683 transitions. [2023-11-30 08:27:10,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2683 transitions. [2023-11-30 08:27:10,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:10,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2683 transitions. [2023-11-30 08:27:10,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 268.3) internal successors, (2683), 10 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:10,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:10,456 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:10,456 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 166 predicate places. [2023-11-30 08:27:10,456 INFO L500 AbstractCegarLoop]: Abstraction has has 443 places, 601 transitions, 8363 flow [2023-11-30 08:27:10,457 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:10,457 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:10,457 INFO L232 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] [2023-11-30 08:27:10,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 08:27:10,457 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:10,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash -115291522, now seen corresponding path program 1 times [2023-11-30 08:27:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619247362] [2023-11-30 08:27:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619247362] [2023-11-30 08:27:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619247362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 08:27:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926803233] [2023-11-30 08:27:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:10,567 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 08:27:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 08:27:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 08:27:10,569 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 332 [2023-11-30 08:27:10,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 601 transitions, 8363 flow. Second operand has 7 states, 7 states have (on average 264.42857142857144) internal successors, (1851), 7 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:10,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:10,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 332 [2023-11-30 08:27:10,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:11,847 INFO L124 PetriNetUnfolderBase]: 1094/7766 cut-off events. [2023-11-30 08:27:11,847 INFO L125 PetriNetUnfolderBase]: For 66331/66959 co-relation queries the response was YES. [2023-11-30 08:27:11,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 7766 events. 1094/7766 cut-off events. For 66331/66959 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 86756 event pairs, 391 based on Foata normal form. 8/6538 useless extension candidates. Maximal degree in co-relation 13292. Up to 1209 conditions per place. [2023-11-30 08:27:11,891 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 206 selfloop transitions, 18 changer transitions 78/593 dead transitions. [2023-11-30 08:27:11,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 593 transitions, 8549 flow [2023-11-30 08:27:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 08:27:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 08:27:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2670 transitions. [2023-11-30 08:27:11,894 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8042168674698795 [2023-11-30 08:27:11,895 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2670 transitions. [2023-11-30 08:27:11,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2670 transitions. [2023-11-30 08:27:11,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:11,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2670 transitions. [2023-11-30 08:27:11,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:11,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:11,901 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:11,901 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 175 predicate places. [2023-11-30 08:27:11,901 INFO L500 AbstractCegarLoop]: Abstraction has has 452 places, 593 transitions, 8549 flow [2023-11-30 08:27:11,902 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 264.42857142857144) internal successors, (1851), 7 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:11,902 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:11,902 INFO L232 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] [2023-11-30 08:27:11,902 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 08:27:11,902 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:11,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -129790278, now seen corresponding path program 1 times [2023-11-30 08:27:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926078288] [2023-11-30 08:27:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926078288] [2023-11-30 08:27:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926078288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:27:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:27:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 08:27:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834750787] [2023-11-30 08:27:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:27:11,997 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 08:27:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 08:27:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 08:27:11,999 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 332 [2023-11-30 08:27:12,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 593 transitions, 8549 flow. Second operand has 7 states, 7 states have (on average 264.57142857142856) internal successors, (1852), 7 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:12,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:12,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 332 [2023-11-30 08:27:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:12,993 INFO L124 PetriNetUnfolderBase]: 873/6069 cut-off events. [2023-11-30 08:27:12,993 INFO L125 PetriNetUnfolderBase]: For 59519/60305 co-relation queries the response was YES. [2023-11-30 08:27:13,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22435 conditions, 6069 events. 873/6069 cut-off events. For 59519/60305 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 63125 event pairs, 252 based on Foata normal form. 5/5105 useless extension candidates. Maximal degree in co-relation 14657. Up to 957 conditions per place. [2023-11-30 08:27:13,061 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 181 selfloop transitions, 13 changer transitions 102/587 dead transitions. [2023-11-30 08:27:13,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 587 transitions, 8863 flow [2023-11-30 08:27:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 08:27:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 08:27:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2668 transitions. [2023-11-30 08:27:13,068 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8036144578313253 [2023-11-30 08:27:13,068 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2668 transitions. [2023-11-30 08:27:13,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2668 transitions. [2023-11-30 08:27:13,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:13,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2668 transitions. [2023-11-30 08:27:13,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 266.8) internal successors, (2668), 10 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:13,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:13,073 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 332.0) internal successors, (3652), 11 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:13,073 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 184 predicate places. [2023-11-30 08:27:13,073 INFO L500 AbstractCegarLoop]: Abstraction has has 461 places, 587 transitions, 8863 flow [2023-11-30 08:27:13,074 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 264.57142857142856) internal successors, (1852), 7 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:13,074 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:13,074 INFO L232 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] [2023-11-30 08:27:13,074 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 08:27:13,074 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:13,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 647582011, now seen corresponding path program 1 times [2023-11-30 08:27:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334564671] [2023-11-30 08:27:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334564671] [2023-11-30 08:27:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334564671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:27:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604554144] [2023-11-30 08:27:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:13,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:13,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:27:13,808 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-11-30 08:27:13,811 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-11-30 08:27:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:13,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-30 08:27:13,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:27:14,106 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-11-30 08:27:14,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:27:14,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:14,336 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-11-30 08:27:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:14,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:27:14,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2023-11-30 08:27:14,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:27:14,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:27:14,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:14,645 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 22 treesize of output 23 [2023-11-30 08:27:14,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:14,653 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 33 treesize of output 29 [2023-11-30 08:27:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-30 08:27:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604554144] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:27:14,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:27:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2023-11-30 08:27:14,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372792888] [2023-11-30 08:27:14,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:27:14,873 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-30 08:27:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-30 08:27:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1275, Unknown=10, NotChecked=222, Total=1640 [2023-11-30 08:27:14,880 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 332 [2023-11-30 08:27:14,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 587 transitions, 8863 flow. Second operand has 41 states, 41 states have (on average 227.41463414634146) internal successors, (9324), 41 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:14,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:14,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 332 [2023-11-30 08:27:14,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:20,993 INFO L124 PetriNetUnfolderBase]: 5666/27640 cut-off events. [2023-11-30 08:27:20,994 INFO L125 PetriNetUnfolderBase]: For 104680/126472 co-relation queries the response was YES. [2023-11-30 08:27:21,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74579 conditions, 27640 events. 5666/27640 cut-off events. For 104680/126472 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 358941 event pairs, 1934 based on Foata normal form. 300/23583 useless extension candidates. Maximal degree in co-relation 60830. Up to 4347 conditions per place. [2023-11-30 08:27:21,670 INFO L140 encePairwiseOnDemand]: 292/332 looper letters, 367 selfloop transitions, 69 changer transitions 106/795 dead transitions. [2023-11-30 08:27:21,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 795 transitions, 11356 flow [2023-11-30 08:27:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-30 08:27:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-30 08:27:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6552 transitions. [2023-11-30 08:27:21,675 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7048192771084337 [2023-11-30 08:27:21,676 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6552 transitions. [2023-11-30 08:27:21,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6552 transitions. [2023-11-30 08:27:21,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:21,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6552 transitions. [2023-11-30 08:27:21,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 234.0) internal successors, (6552), 28 states have internal predecessors, (6552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:21,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:21,691 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:21,692 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 211 predicate places. [2023-11-30 08:27:21,692 INFO L500 AbstractCegarLoop]: Abstraction has has 488 places, 795 transitions, 11356 flow [2023-11-30 08:27:21,693 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 227.41463414634146) internal successors, (9324), 41 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:21,693 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:21,693 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:27:21,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 08:27:21,899 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 08:27:21,899 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:21,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1498847424, now seen corresponding path program 1 times [2023-11-30 08:27:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342504076] [2023-11-30 08:27:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 08:27:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342504076] [2023-11-30 08:27:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342504076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:27:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036617045] [2023-11-30 08:27:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:27:22,225 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-11-30 08:27:22,249 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-11-30 08:27:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:22,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 08:27:22,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:27:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:22,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:27:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036617045] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:27:22,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:27:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 23 [2023-11-30 08:27:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455319783] [2023-11-30 08:27:22,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:27:22,845 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 08:27:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 08:27:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-11-30 08:27:22,851 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 332 [2023-11-30 08:27:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 795 transitions, 11356 flow. Second operand has 23 states, 23 states have (on average 250.0) internal successors, (5750), 23 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:22,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:22,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 332 [2023-11-30 08:27:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:30,473 INFO L124 PetriNetUnfolderBase]: 9105/45266 cut-off events. [2023-11-30 08:27:30,473 INFO L125 PetriNetUnfolderBase]: For 202036/240948 co-relation queries the response was YES. [2023-11-30 08:27:30,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126417 conditions, 45266 events. 9105/45266 cut-off events. For 202036/240948 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 644898 event pairs, 2920 based on Foata normal form. 522/38704 useless extension candidates. Maximal degree in co-relation 61122. Up to 6585 conditions per place. [2023-11-30 08:27:30,982 INFO L140 encePairwiseOnDemand]: 311/332 looper letters, 414 selfloop transitions, 59 changer transitions 134/1026 dead transitions. [2023-11-30 08:27:30,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 1026 transitions, 18293 flow [2023-11-30 08:27:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 08:27:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 08:27:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6050 transitions. [2023-11-30 08:27:30,989 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7592871485943775 [2023-11-30 08:27:30,989 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 6050 transitions. [2023-11-30 08:27:30,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 6050 transitions. [2023-11-30 08:27:30,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:30,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 6050 transitions. [2023-11-30 08:27:30,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 252.08333333333334) internal successors, (6050), 24 states have internal predecessors, (6050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:31,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:31,008 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:31,008 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 233 predicate places. [2023-11-30 08:27:31,008 INFO L500 AbstractCegarLoop]: Abstraction has has 510 places, 1026 transitions, 18293 flow [2023-11-30 08:27:31,009 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 250.0) internal successors, (5750), 23 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:31,009 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:31,009 INFO L232 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] [2023-11-30 08:27:31,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-30 08:27:31,216 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:31,217 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:31,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1337392485, now seen corresponding path program 1 times [2023-11-30 08:27:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849287512] [2023-11-30 08:27:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849287512] [2023-11-30 08:27:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849287512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:27:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278358690] [2023-11-30 08:27:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:32,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:27:32,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:27:32,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 08:27:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:32,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 08:27:32,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:27:32,453 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-11-30 08:27:32,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:27:32,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:32,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:27:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:32,751 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-11-30 08:27:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:27:32,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:27:33,019 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:27:33,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:27:33,037 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:27:33,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:33,066 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 25 treesize of output 26 [2023-11-30 08:27:33,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:33,073 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 125 treesize of output 117 [2023-11-30 08:27:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-30 08:27:33,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-30 08:27:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-30 08:27:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278358690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:27:33,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:27:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2023-11-30 08:27:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919391484] [2023-11-30 08:27:33,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:27:33,464 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-30 08:27:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:33,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-30 08:27:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1640, Unknown=19, NotChecked=252, Total=2070 [2023-11-30 08:27:33,470 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 332 [2023-11-30 08:27:33,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 1026 transitions, 18293 flow. Second operand has 46 states, 46 states have (on average 225.1086956521739) internal successors, (10355), 46 states have internal predecessors, (10355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:33,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:33,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 332 [2023-11-30 08:27:33,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:27:51,032 INFO L124 PetriNetUnfolderBase]: 16176/78533 cut-off events. [2023-11-30 08:27:51,032 INFO L125 PetriNetUnfolderBase]: For 389169/438226 co-relation queries the response was YES. [2023-11-30 08:27:51,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243927 conditions, 78533 events. 16176/78533 cut-off events. For 389169/438226 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 1205988 event pairs, 4558 based on Foata normal form. 647/66997 useless extension candidates. Maximal degree in co-relation 70611. Up to 13055 conditions per place. [2023-11-30 08:27:52,381 INFO L140 encePairwiseOnDemand]: 292/332 looper letters, 690 selfloop transitions, 92 changer transitions 140/1280 dead transitions. [2023-11-30 08:27:52,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 1280 transitions, 24611 flow [2023-11-30 08:27:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-30 08:27:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-30 08:27:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6058 transitions. [2023-11-30 08:27:52,401 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7018072289156626 [2023-11-30 08:27:52,401 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6058 transitions. [2023-11-30 08:27:52,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6058 transitions. [2023-11-30 08:27:52,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:27:52,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6058 transitions. [2023-11-30 08:27:52,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 233.0) internal successors, (6058), 26 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:52,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 332.0) internal successors, (8964), 27 states have internal predecessors, (8964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:52,417 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 332.0) internal successors, (8964), 27 states have internal predecessors, (8964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:52,418 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 258 predicate places. [2023-11-30 08:27:52,418 INFO L500 AbstractCegarLoop]: Abstraction has has 535 places, 1280 transitions, 24611 flow [2023-11-30 08:27:52,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 225.1086956521739) internal successors, (10355), 46 states have internal predecessors, (10355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:52,420 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:27:52,420 INFO L232 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] [2023-11-30 08:27:52,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 08:27:52,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:52,626 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:27:52,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:27:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1128705097, now seen corresponding path program 1 times [2023-11-30 08:27:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:27:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046531395] [2023-11-30 08:27:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:27:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:27:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046531395] [2023-11-30 08:27:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046531395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:27:53,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375061859] [2023-11-30 08:27:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:27:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:27:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:27:53,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:27:53,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 08:27:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:27:53,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 08:27:53,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:27:54,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 08:27:54,240 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-11-30 08:27:54,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 08:27:54,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 08:27:54,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:27:54,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:55,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:27:55,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:27:55,058 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-11-30 08:27:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 08:27:55,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:27:55,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2023-11-30 08:27:55,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:55,811 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 28 treesize of output 29 [2023-11-30 08:27:55,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:55,820 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 246 treesize of output 238 [2023-11-30 08:27:55,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-30 08:27:55,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2023-11-30 08:27:55,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-30 08:27:56,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:27:56,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2023-11-30 08:27:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 08:27:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375061859] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:27:56,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:27:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 57 [2023-11-30 08:27:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158505753] [2023-11-30 08:27:56,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:27:56,365 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-30 08:27:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:27:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-30 08:27:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2930, Unknown=17, NotChecked=110, Total=3306 [2023-11-30 08:27:56,375 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 332 [2023-11-30 08:27:56,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1280 transitions, 24611 flow. Second operand has 58 states, 58 states have (on average 172.10344827586206) internal successors, (9982), 58 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:27:56,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:27:56,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 332 [2023-11-30 08:27:56,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:28:28,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][939], [2355#true, 95#minus_returnLabel#1true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:28,291 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2023-11-30 08:28:28,291 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:28:28,291 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:28:28,291 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:28:29,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][939], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 193#L52-6true, 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:29,717 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2023-11-30 08:28:29,717 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:28:29,717 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:28:29,718 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:28:30,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][939], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 212#L52-7true]) [2023-11-30 08:28:30,343 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2023-11-30 08:28:30,343 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:28:30,343 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:28:30,343 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:28:33,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][939], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 208#L52-11true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:33,122 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2023-11-30 08:28:33,122 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:28:33,122 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:28:33,122 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:28:43,617 INFO L124 PetriNetUnfolderBase]: 47017/167181 cut-off events. [2023-11-30 08:28:43,617 INFO L125 PetriNetUnfolderBase]: For 628868/763921 co-relation queries the response was YES. [2023-11-30 08:28:45,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528917 conditions, 167181 events. 47017/167181 cut-off events. For 628868/763921 co-relation queries the response was YES. Maximal size of possible extension queue 6683. Compared 2829348 event pairs, 17442 based on Foata normal form. 377/132878 useless extension candidates. Maximal degree in co-relation 174109. Up to 31177 conditions per place. [2023-11-30 08:28:46,585 INFO L140 encePairwiseOnDemand]: 282/332 looper letters, 1161 selfloop transitions, 120 changer transitions 158/1926 dead transitions. [2023-11-30 08:28:46,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 1926 transitions, 34499 flow [2023-11-30 08:28:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-30 08:28:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-30 08:28:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 8967 transitions. [2023-11-30 08:28:46,593 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5401807228915663 [2023-11-30 08:28:46,593 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 8967 transitions. [2023-11-30 08:28:46,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 8967 transitions. [2023-11-30 08:28:46,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:28:46,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 8967 transitions. [2023-11-30 08:28:46,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 179.34) internal successors, (8967), 50 states have internal predecessors, (8967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:28:46,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 332.0) internal successors, (16932), 51 states have internal predecessors, (16932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:28:46,614 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 332.0) internal successors, (16932), 51 states have internal predecessors, (16932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:28:46,615 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 307 predicate places. [2023-11-30 08:28:46,615 INFO L500 AbstractCegarLoop]: Abstraction has has 584 places, 1926 transitions, 34499 flow [2023-11-30 08:28:46,616 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 172.10344827586206) internal successors, (9982), 58 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:28:46,616 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:28:46,617 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:28:46,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 08:28:46,823 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:28:46,823 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:28:46,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:28:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 886228188, now seen corresponding path program 1 times [2023-11-30 08:28:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:28:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168568156] [2023-11-30 08:28:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:28:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:28:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:28:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 08:28:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:28:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168568156] [2023-11-30 08:28:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168568156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:28:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964315594] [2023-11-30 08:28:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:28:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:28:46,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:28:46,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:28:46,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 08:28:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:28:47,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-30 08:28:47,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:28:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:28:47,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:28:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:28:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964315594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:28:47,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:28:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 23 [2023-11-30 08:28:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460903720] [2023-11-30 08:28:47,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:28:47,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 08:28:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:28:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 08:28:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-11-30 08:28:47,456 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 332 [2023-11-30 08:28:47,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 1926 transitions, 34499 flow. Second operand has 23 states, 23 states have (on average 250.08695652173913) internal successors, (5752), 23 states have internal predecessors, (5752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:28:47,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:28:47,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 332 [2023-11-30 08:28:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:28:56,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([857] L64-2-->L65: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_3| v_~n1~0_14) (< |v_thread2Thread1of1ForFork1_~i~1#1_3| v_~n2~0_14)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][1408], [2355#true, 20#L50-2true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 16#L65true, 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:56,443 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,443 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,443 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,443 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([858] L64-2-->L64-3: Formula: (or (<= v_~n1~0_13 |v_thread2Thread1of1ForFork1_~i~1#1_5|) (<= v_~n2~0_13 |v_thread2Thread1of1ForFork1_~i~1#1_5|)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~n2~0=v_~n2~0_13, ~n1~0=v_~n1~0_13} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~n2~0=v_~n2~0_13, ~n1~0=v_~n1~0_13} AuxVars[] AssignedVars[][1409], [2355#true, 20#L50-2true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 144#L64-3true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:56,444 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([776] L50-2-->L51: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_3| v_~n1~0_7) (< |v_thread1Thread1of1ForFork0_~i~0#1_3| v_~n2~0_7)) InVars {~n2~0=v_~n2~0_7, ~n1~0=v_~n1~0_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|} OutVars{~n2~0=v_~n2~0_7, ~n1~0=v_~n1~0_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|} AuxVars[] AssignedVars[][1410], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 205#L64-2true, 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 162#L51true, 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:56,444 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:28:56,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([777] L50-2-->L50-3: Formula: (or (<= v_~n1~0_6 |v_thread1Thread1of1ForFork0_~i~0#1_5|) (<= v_~n2~0_6 |v_thread1Thread1of1ForFork0_~i~0#1_5|)) InVars {~n2~0=v_~n2~0_6, ~n1~0=v_~n1~0_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n2~0=v_~n2~0_6, ~n1~0=v_~n1~0_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[][1411], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 205#L64-2true, 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 203#L50-3true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:28:56,444 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,445 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,445 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 08:28:56,445 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 08:29:07,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][965], [2355#true, 95#minus_returnLabel#1true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 519#true, 324#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:07,650 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2023-11-30 08:29:07,650 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:07,650 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:07,650 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:08,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][965], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 193#L52-6true, 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 519#true, 324#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:08,361 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2023-11-30 08:29:08,361 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:08,362 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:08,362 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:08,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][965], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 519#true, 324#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 212#L52-7true]) [2023-11-30 08:29:08,711 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2023-11-30 08:29:08,711 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:08,712 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:08,712 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:10,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][965], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 208#L52-11true, 2419#true, 2378#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 519#true, 324#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:10,328 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2023-11-30 08:29:10,328 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:29:10,328 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:29:10,328 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:29:17,222 INFO L124 PetriNetUnfolderBase]: 38812/135337 cut-off events. [2023-11-30 08:29:17,222 INFO L125 PetriNetUnfolderBase]: For 610149/765791 co-relation queries the response was YES. [2023-11-30 08:29:19,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452237 conditions, 135337 events. 38812/135337 cut-off events. For 610149/765791 co-relation queries the response was YES. Maximal size of possible extension queue 5363. Compared 2220423 event pairs, 14835 based on Foata normal form. 1976/108760 useless extension candidates. Maximal degree in co-relation 181681. Up to 26125 conditions per place. [2023-11-30 08:29:19,733 INFO L140 encePairwiseOnDemand]: 311/332 looper letters, 755 selfloop transitions, 59 changer transitions 182/1827 dead transitions. [2023-11-30 08:29:19,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1827 transitions, 36859 flow [2023-11-30 08:29:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 08:29:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 08:29:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6048 transitions. [2023-11-30 08:29:19,739 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7590361445783133 [2023-11-30 08:29:19,739 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 6048 transitions. [2023-11-30 08:29:19,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 6048 transitions. [2023-11-30 08:29:19,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:29:19,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 6048 transitions. [2023-11-30 08:29:19,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 252.0) internal successors, (6048), 24 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:29:19,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:29:19,750 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:29:19,751 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 325 predicate places. [2023-11-30 08:29:19,751 INFO L500 AbstractCegarLoop]: Abstraction has has 602 places, 1827 transitions, 36859 flow [2023-11-30 08:29:19,752 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 250.08695652173913) internal successors, (5752), 23 states have internal predecessors, (5752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:29:19,752 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:29:19,752 INFO L232 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] [2023-11-30 08:29:19,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-30 08:29:19,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-30 08:29:19,958 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:29:19,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:29:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash -962461694, now seen corresponding path program 1 times [2023-11-30 08:29:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:29:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753803566] [2023-11-30 08:29:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:29:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:29:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:29:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:29:20,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:29:20,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753803566] [2023-11-30 08:29:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753803566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:29:20,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167812855] [2023-11-30 08:29:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:29:20,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:29:20,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:29:20,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:29:20,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 08:29:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:29:20,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-30 08:29:20,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:29:20,762 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-11-30 08:29:20,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:29:20,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-30 08:29:20,969 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 17 treesize of output 9 [2023-11-30 08:29:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:29:21,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:29:21,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_447) c_~a2~0.base) c_~a2~0.offset)))) is different from false [2023-11-30 08:29:21,137 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 4294967296))) is different from false [2023-11-30 08:29:21,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296))) is different from false [2023-11-30 08:29:21,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:29:21,205 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 24 treesize of output 25 [2023-11-30 08:29:21,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:29:21,211 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 37 treesize of output 33 [2023-11-30 08:29:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:29:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167812855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:29:21,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:29:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2023-11-30 08:29:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583451368] [2023-11-30 08:29:21,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:29:21,419 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-30 08:29:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:29:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-30 08:29:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1277, Unknown=7, NotChecked=222, Total=1640 [2023-11-30 08:29:21,425 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 332 [2023-11-30 08:29:21,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 1827 transitions, 36859 flow. Second operand has 41 states, 41 states have (on average 227.41463414634146) internal successors, (9324), 41 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:29:21,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:29:21,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 332 [2023-11-30 08:29:21,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:29:44,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][961], [2355#true, 95#minus_returnLabel#1true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 6773#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:44,112 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2023-11-30 08:29:44,113 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:44,113 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:44,113 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2023-11-30 08:29:45,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][961], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 6773#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 193#L52-6true, 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:45,214 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2023-11-30 08:29:45,214 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:45,214 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:45,214 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-30 08:29:45,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][961], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 6773#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 212#L52-7true]) [2023-11-30 08:29:45,726 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2023-11-30 08:29:45,726 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:45,726 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:45,726 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-30 08:29:47,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][961], [2355#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 208#L52-11true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 940#true, 6773#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 2439#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|), 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 324#true, 519#true, 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true, 4959#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2023-11-30 08:29:47,803 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2023-11-30 08:29:47,803 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:29:47,803 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:29:47,803 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 08:30:00,927 INFO L124 PetriNetUnfolderBase]: 38669/133771 cut-off events. [2023-11-30 08:30:00,928 INFO L125 PetriNetUnfolderBase]: For 689023/993913 co-relation queries the response was YES. [2023-11-30 08:30:02,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496640 conditions, 133771 events. 38669/133771 cut-off events. For 689023/993913 co-relation queries the response was YES. Maximal size of possible extension queue 5332. Compared 2185818 event pairs, 13967 based on Foata normal form. 1101/107755 useless extension candidates. Maximal degree in co-relation 199170. Up to 31960 conditions per place. [2023-11-30 08:30:03,501 INFO L140 encePairwiseOnDemand]: 292/332 looper letters, 1299 selfloop transitions, 109 changer transitions 182/2125 dead transitions. [2023-11-30 08:30:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 2125 transitions, 44753 flow [2023-11-30 08:30:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-30 08:30:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-30 08:30:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6532 transitions. [2023-11-30 08:30:03,506 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7026678141135972 [2023-11-30 08:30:03,506 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6532 transitions. [2023-11-30 08:30:03,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6532 transitions. [2023-11-30 08:30:03,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:30:03,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6532 transitions. [2023-11-30 08:30:03,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 233.28571428571428) internal successors, (6532), 28 states have internal predecessors, (6532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:03,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:03,521 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:03,521 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 352 predicate places. [2023-11-30 08:30:03,521 INFO L500 AbstractCegarLoop]: Abstraction has has 629 places, 2125 transitions, 44753 flow [2023-11-30 08:30:03,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 227.41463414634146) internal successors, (9324), 41 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:03,523 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:30:03,523 INFO L232 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] [2023-11-30 08:30:03,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-30 08:30:03,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-30 08:30:03,728 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:30:03,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:30:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash 228459416, now seen corresponding path program 1 times [2023-11-30 08:30:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:30:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548110017] [2023-11-30 08:30:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:30:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:30:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:30:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 08:30:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:30:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548110017] [2023-11-30 08:30:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548110017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:30:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:30:03,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 08:30:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905790433] [2023-11-30 08:30:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:30:03,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 08:30:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:30:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 08:30:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 08:30:03,792 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 332 [2023-11-30 08:30:03,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 2125 transitions, 44753 flow. Second operand has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:03,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:30:03,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 332 [2023-11-30 08:30:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:30:39,800 INFO L124 PetriNetUnfolderBase]: 37977/133223 cut-off events. [2023-11-30 08:30:39,800 INFO L125 PetriNetUnfolderBase]: For 715208/977279 co-relation queries the response was YES. [2023-11-30 08:30:41,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509863 conditions, 133223 events. 37977/133223 cut-off events. For 715208/977279 co-relation queries the response was YES. Maximal size of possible extension queue 5128. Compared 2183318 event pairs, 14204 based on Foata normal form. 453/107527 useless extension candidates. Maximal degree in co-relation 206464. Up to 32729 conditions per place. [2023-11-30 08:30:42,307 INFO L140 encePairwiseOnDemand]: 327/332 looper letters, 370 selfloop transitions, 23 changer transitions 182/2121 dead transitions. [2023-11-30 08:30:42,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 2121 transitions, 46383 flow [2023-11-30 08:30:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 08:30:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 08:30:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1191 transitions. [2023-11-30 08:30:42,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8968373493975904 [2023-11-30 08:30:42,309 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1191 transitions. [2023-11-30 08:30:42,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1191 transitions. [2023-11-30 08:30:42,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:30:42,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1191 transitions. [2023-11-30 08:30:42,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 297.75) internal successors, (1191), 4 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:42,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:42,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:42,311 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 355 predicate places. [2023-11-30 08:30:42,311 INFO L500 AbstractCegarLoop]: Abstraction has has 632 places, 2121 transitions, 46383 flow [2023-11-30 08:30:42,311 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:42,311 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:30:42,311 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 08:30:42,311 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-30 08:30:42,311 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:30:42,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:30:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2139467848, now seen corresponding path program 2 times [2023-11-30 08:30:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:30:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614091206] [2023-11-30 08:30:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:30:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:30:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:30:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:30:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:30:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614091206] [2023-11-30 08:30:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614091206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 08:30:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703034936] [2023-11-30 08:30:42,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 08:30:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 08:30:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 08:30:42,908 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 08:30:42,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 08:30:43,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 08:30:43,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 08:30:43,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-30 08:30:43,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 08:30:43,222 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-11-30 08:30:43,339 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-30 08:30:43,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 31 treesize of output 11 [2023-11-30 08:30:43,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 08:30:43,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 08:30:43,561 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-11-30 08:30:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 08:30:43,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 08:30:43,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:30:43,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2023-11-30 08:30:44,195 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-11-30 08:30:44,195 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 2 case distinctions, treesize of input 29 treesize of output 35 [2023-11-30 08:30:44,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 08:30:44,202 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 33 treesize of output 29 [2023-11-30 08:30:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2023-11-30 08:30:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703034936] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 08:30:46,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 08:30:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2023-11-30 08:30:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691378200] [2023-11-30 08:30:46,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 08:30:46,429 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-30 08:30:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:30:46,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-30 08:30:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1958, Unknown=34, NotChecked=182, Total=2352 [2023-11-30 08:30:46,437 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 332 [2023-11-30 08:30:46,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 2121 transitions, 46383 flow. Second operand has 49 states, 49 states have (on average 217.77551020408163) internal successors, (10671), 49 states have internal predecessors, (10671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:30:46,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:30:46,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 332 [2023-11-30 08:30:46,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:31:40,291 INFO L124 PetriNetUnfolderBase]: 43716/154989 cut-off events. [2023-11-30 08:31:40,291 INFO L125 PetriNetUnfolderBase]: For 944984/1589081 co-relation queries the response was YES. [2023-11-30 08:31:42,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643932 conditions, 154989 events. 43716/154989 cut-off events. For 944984/1589081 co-relation queries the response was YES. Maximal size of possible extension queue 5967. Compared 2599765 event pairs, 16338 based on Foata normal form. 3790/128609 useless extension candidates. Maximal degree in co-relation 239225. Up to 38411 conditions per place. [2023-11-30 08:31:43,337 INFO L140 encePairwiseOnDemand]: 288/332 looper letters, 1594 selfloop transitions, 227 changer transitions 194/2490 dead transitions. [2023-11-30 08:31:43,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 2490 transitions, 56505 flow [2023-11-30 08:31:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-30 08:31:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-30 08:31:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 7125 transitions. [2023-11-30 08:31:43,343 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6706513554216867 [2023-11-30 08:31:43,343 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 7125 transitions. [2023-11-30 08:31:43,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 7125 transitions. [2023-11-30 08:31:43,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 08:31:43,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 7125 transitions. [2023-11-30 08:31:43,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 222.65625) internal successors, (7125), 32 states have internal predecessors, (7125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:31:43,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 332.0) internal successors, (10956), 33 states have internal predecessors, (10956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:31:43,357 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 332.0) internal successors, (10956), 33 states have internal predecessors, (10956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:31:43,358 INFO L307 CegarLoopForPetriNet]: 277 programPoint places, 386 predicate places. [2023-11-30 08:31:43,358 INFO L500 AbstractCegarLoop]: Abstraction has has 663 places, 2490 transitions, 56505 flow [2023-11-30 08:31:43,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 217.77551020408163) internal successors, (10671), 49 states have internal predecessors, (10671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:31:43,359 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 08:31:43,360 INFO L232 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] [2023-11-30 08:31:43,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-30 08:31:43,568 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-30 08:31:43,568 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2023-11-30 08:31:43,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 08:31:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash 206334719, now seen corresponding path program 1 times [2023-11-30 08:31:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 08:31:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110449963] [2023-11-30 08:31:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 08:31:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 08:31:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 08:31:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 08:31:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 08:31:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110449963] [2023-11-30 08:31:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110449963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 08:31:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 08:31:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 08:31:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771891446] [2023-11-30 08:31:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 08:31:43,632 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 08:31:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 08:31:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 08:31:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 08:31:43,634 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 332 [2023-11-30 08:31:43,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 2490 transitions, 56505 flow. Second operand has 5 states, 5 states have (on average 286.8) internal successors, (1434), 5 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 08:31:43,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 08:31:43,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 332 [2023-11-30 08:31:43,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 08:32:08,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][2178], [2355#true, 79#L110-5true, 8588#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 7666#(<= |thread1Thread1of1ForFork0_minus_~b#1| 0), 8582#(and (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|)), 940#true, 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 7657#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ |thread1Thread1of1ForFork0_minus_~b#1| 4294967295))), 4975#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 519#true, 324#true, 2360#true, 3280#(and (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|)), 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true]) [2023-11-30 08:32:08,133 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2023-11-30 08:32:08,133 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-30 08:32:08,133 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-30 08:32:08,133 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-30 08:32:08,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L65-->L65-1: Formula: (= (select (select |v_#memory_int_7| v_~a1~0.base_4) (+ v_~a1~0.offset_4 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) InVars {~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} OutVars{~a1~0.offset=v_~a1~0.offset_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~a1~0.base=v_~a1~0.base_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7#1][2178], [2355#true, 8588#true, 921#(and (<= 0 (+ ~n1~0 2147483648)) (<= ~n2~0 (+ ~n1~0 2147483648))), 2348#true, 2419#true, 1799#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 2378#true, 317#true, 1646#(<= 0 ~n1~0), 2401#true, 7666#(<= |thread1Thread1of1ForFork0_minus_~b#1| 0), 8582#(and (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|)), 940#true, 196#L110-6true, 3288#(<= 1 |thread1Thread1of1ForFork0_~i~0#1|), 2383#true, 5876#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1050#(<= ~n1~0 2147483647), 2249#(and (<= ~n1~0 2147483647) (<= 0 ~n2~0)), 5921#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), 267#L65-1true, 7657#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ |thread1Thread1of1ForFork0_minus_~b#1| 4294967295))), 4975#(and (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~a2~0.offset 0) (<= (+ 2 ~a2~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (<= (select (select |#memory_int| ~a2~0.base) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 519#true, 324#true, 3280#(and (<= |thread1Thread1of1ForFork0_minus_~b#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|)), 2360#true, 78#L86-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 2013#true]) [2023-11-30 08:32:08,796 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2023-11-30 08:32:08,796 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-11-30 08:32:08,796 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-11-30 08:32:08,796 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event