/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/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 06:22:13,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 06:22:13,489 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 06:22:13,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 06:22:13,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 06:22:13,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 06:22:13,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 06:22:13,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 06:22:13,507 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 06:22:13,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 06:22:13,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 06:22:13,507 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 06:22:13,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 06:22:13,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 06:22:13,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 06:22:13,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 06:22:13,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 06:22:13,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 06:22:13,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 06:22:13,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 06:22:13,509 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 06:22:13,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 06:22:13,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 06:22:13,510 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 06:22:13,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 06:22:13,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:13,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 06:22:13,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 06:22:13,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 06:22:13,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 06:22:13,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 06:22:13,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 06:22:13,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 06:22:13,513 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 06:22:13,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 06:22:13,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 06:22:13,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 06:22:13,681 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 06:22:13,681 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 06:22:13,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2023-11-30 06:22:14,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 06:22:14,985 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 06:22:14,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2023-11-30 06:22:15,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0646be5f1/2d1655a6e3454ab585cd5f1ddbf94bf6/FLAGb1f24e00b [2023-11-30 06:22:15,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0646be5f1/2d1655a6e3454ab585cd5f1ddbf94bf6 [2023-11-30 06:22:15,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 06:22:15,022 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 06:22:15,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:15,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 06:22:15,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 06:22:15,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c1ecaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15, skipping insertion in model container [2023-11-30 06:22:15,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,067 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 06:22:15,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:15,340 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 06:22:15,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:15,405 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:15,406 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:15,410 INFO L206 MainTranslator]: Completed translation [2023-11-30 06:22:15,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15 WrapperNode [2023-11-30 06:22:15,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:15,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:15,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 06:22:15,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 06:22:15,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,453 INFO L138 Inliner]: procedures = 169, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-11-30 06:22:15,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:15,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 06:22:15,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 06:22:15,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 06:22:15,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 06:22:15,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 06:22:15,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 06:22:15,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 06:22:15,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (1/1) ... [2023-11-30 06:22:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:15,504 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 06:22:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 06:22:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 06:22:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 06:22:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 06:22:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 06:22:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 06:22:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 06:22:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 06:22:15,543 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 06:22:15,537 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 06:22:15,626 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 06:22:15,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 06:22:15,809 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 06:22:15,836 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 06:22:15,836 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 06:22:15,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:15 BoogieIcfgContainer [2023-11-30 06:22:15,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 06:22:15,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 06:22:15,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 06:22:15,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 06:22:15,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 06:22:15" (1/3) ... [2023-11-30 06:22:15,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12043e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:15, skipping insertion in model container [2023-11-30 06:22:15,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:15" (2/3) ... [2023-11-30 06:22:15,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12043e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:15, skipping insertion in model container [2023-11-30 06:22:15,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:15" (3/3) ... [2023-11-30 06:22:15,846 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2023-11-30 06:22:15,858 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 06:22:15,858 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 06:22:15,858 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 06:22:15,906 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 06:22:15,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:15,954 INFO L124 PetriNetUnfolderBase]: 6/82 cut-off events. [2023-11-30 06:22:15,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 6/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-30 06:22:15,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:15,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 170 flow [2023-11-30 06:22:15,969 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 06:22:15,973 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;@3689bdbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 06:22:15,974 INFO L363 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-30 06:22:15,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 06:22:15,980 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-30 06:22:15,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:15,980 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:15,981 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] [2023-11-30 06:22:15,981 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:15,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash -184951082, now seen corresponding path program 1 times [2023-11-30 06:22:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144287847] [2023-11-30 06:22:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,185 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 06:22:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144287847] [2023-11-30 06:22:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144287847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550890462] [2023-11-30 06:22:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,194 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:16,216 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:16,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 06:22:16,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:16,315 INFO L124 PetriNetUnfolderBase]: 90/315 cut-off events. [2023-11-30 06:22:16,315 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 06:22:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 315 events. 90/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1565 event pairs, 23 based on Foata normal form. 81/286 useless extension candidates. Maximal degree in co-relation 438. Up to 69 conditions per place. [2023-11-30 06:22:16,323 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-30 06:22:16,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-30 06:22:16,334 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2023-11-30 06:22:16,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-30 06:22:16,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-30 06:22:16,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:16,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-30 06:22:16,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 06:22:16,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:16,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:16,352 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2023-11-30 06:22:16,352 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:16,352 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 06:22:16,353 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:16,353 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] [2023-11-30 06:22:16,353 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 06:22:16,353 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:16,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -184951081, now seen corresponding path program 1 times [2023-11-30 06:22:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:16,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981891654] [2023-11-30 06:22:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:16,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,438 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 06:22:16,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981891654] [2023-11-30 06:22:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981891654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:16,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138472018] [2023-11-30 06:22:16,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,439 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:16,441 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:16,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 06:22:16,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:16,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:16,581 INFO L124 PetriNetUnfolderBase]: 75/327 cut-off events. [2023-11-30 06:22:16,582 INFO L125 PetriNetUnfolderBase]: For 33/61 co-relation queries the response was YES. [2023-11-30 06:22:16,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 327 events. 75/327 cut-off events. For 33/61 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1581 event pairs, 10 based on Foata normal form. 6/233 useless extension candidates. Maximal degree in co-relation 559. Up to 76 conditions per place. [2023-11-30 06:22:16,585 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 19 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-11-30 06:22:16,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-30 06:22:16,590 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2023-11-30 06:22:16,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-30 06:22:16,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-30 06:22:16,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:16,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-30 06:22:16,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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 06:22:16,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:16,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:16,594 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-11-30 06:22:16,594 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:16,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 06:22:16,595 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:16,595 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] [2023-11-30 06:22:16,595 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 06:22:16,595 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:16,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1644321734, now seen corresponding path program 1 times [2023-11-30 06:22:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736678782] [2023-11-30 06:22:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,729 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 06:22:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736678782] [2023-11-30 06:22:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736678782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704673291] [2023-11-30 06:22:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:16,731 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:16,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 06:22:16,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:16,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:16,897 INFO L124 PetriNetUnfolderBase]: 317/874 cut-off events. [2023-11-30 06:22:16,900 INFO L125 PetriNetUnfolderBase]: For 423/565 co-relation queries the response was YES. [2023-11-30 06:22:16,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 874 events. 317/874 cut-off events. For 423/565 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6203 event pairs, 117 based on Foata normal form. 11/560 useless extension candidates. Maximal degree in co-relation 2238. Up to 350 conditions per place. [2023-11-30 06:22:16,909 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 62 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-11-30 06:22:16,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2023-11-30 06:22:16,910 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-11-30 06:22:16,910 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 343 transitions. [2023-11-30 06:22:16,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 343 transitions. [2023-11-30 06:22:16,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:16,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 343 transitions. [2023-11-30 06:22:16,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 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 06:22:16,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:16,913 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:16,914 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2023-11-30 06:22:16,914 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:16,914 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 06:22:16,915 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:16,915 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] [2023-11-30 06:22:16,915 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 06:22:16,915 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:16,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346421, now seen corresponding path program 1 times [2023-11-30 06:22:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511608762] [2023-11-30 06:22:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:16,991 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 06:22:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:16,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511608762] [2023-11-30 06:22:16,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511608762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:16,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:16,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060788952] [2023-11-30 06:22:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:16,992 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:16,993 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:16,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 125 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 06:22:16,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:16,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,121 INFO L124 PetriNetUnfolderBase]: 479/1478 cut-off events. [2023-11-30 06:22:17,121 INFO L125 PetriNetUnfolderBase]: For 1228/1455 co-relation queries the response was YES. [2023-11-30 06:22:17,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 1478 events. 479/1478 cut-off events. For 1228/1455 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12582 event pairs, 128 based on Foata normal form. 5/1014 useless extension candidates. Maximal degree in co-relation 3997. Up to 545 conditions per place. [2023-11-30 06:22:17,133 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:17,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-30 06:22:17,135 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2023-11-30 06:22:17,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-30 06:22:17,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-30 06:22:17,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-30 06:22:17,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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 06:22:17,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:17,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:17,138 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2023-11-30 06:22:17,138 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:17,138 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 06:22:17,138 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,139 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] [2023-11-30 06:22:17,139 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 06:22:17,139 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:17,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346422, now seen corresponding path program 1 times [2023-11-30 06:22:17,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988762486] [2023-11-30 06:22:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,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 06:22:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988762486] [2023-11-30 06:22:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988762486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582835129] [2023-11-30 06:22:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,206 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:17,208 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:17,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 138 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 06:22:17,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:17,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,318 INFO L124 PetriNetUnfolderBase]: 482/1304 cut-off events. [2023-11-30 06:22:17,318 INFO L125 PetriNetUnfolderBase]: For 1939/2254 co-relation queries the response was YES. [2023-11-30 06:22:17,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4278 conditions, 1304 events. 482/1304 cut-off events. For 1939/2254 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9908 event pairs, 110 based on Foata normal form. 12/880 useless extension candidates. Maximal degree in co-relation 4241. Up to 633 conditions per place. [2023-11-30 06:22:17,328 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:17,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-30 06:22:17,329 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-30 06:22:17,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-30 06:22:17,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-30 06:22:17,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-30 06:22:17,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 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 06:22:17,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:17,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 06:22:17,332 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2023-11-30 06:22:17,333 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:17,333 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 06:22:17,333 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,333 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] [2023-11-30 06:22:17,333 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 06:22:17,333 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:17,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1243348462, now seen corresponding path program 1 times [2023-11-30 06:22:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172821772] [2023-11-30 06:22:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,396 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 06:22:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172821772] [2023-11-30 06:22:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172821772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062799010] [2023-11-30 06:22:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,401 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:17,403 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 138 transitions, 961 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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 06:22:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:17,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 70#L699true, 107#true, 103#true, 48#L704-7true, 92#true]) [2023-11-30 06:22:17,628 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,628 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,628 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,628 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:17,629 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 92#true]) [2023-11-30 06:22:17,629 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:17,629 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:17,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 105#(<= ~i~0 3), 52#L697true, 92#true]) [2023-11-30 06:22:17,635 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 52#L697true, 92#true]) [2023-11-30 06:22:17,635 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 80#L707true, 96#true, 107#true, 103#true, 52#L697true, 92#true]) [2023-11-30 06:22:17,636 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 70#L699true, 103#true, 92#true]) [2023-11-30 06:22:17,636 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 107#true, 96#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:17,636 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,636 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:17,637 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 88#true, 70#L699true, 96#true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:17,638 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,638 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,638 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,638 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 94#(<= ~j~0 6)]) [2023-11-30 06:22:17,639 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:17,639 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,639 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 107#true, 96#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:17,640 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:17,640 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,640 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 96#true, 107#true, 80#L707true, 103#true, 92#true]) [2023-11-30 06:22:17,641 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 96#true, 107#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:17,641 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,641 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][143], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:17,642 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][144], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 80#L707true, 96#true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:17,642 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:17,642 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:17,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 70#L699true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:17,645 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 96#true, 107#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:17,645 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][135], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), 44#L709true, t1Thread1of1ForFork0InUse, 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:17,645 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,646 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:17,646 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,646 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:17,650 INFO L124 PetriNetUnfolderBase]: 1180/2522 cut-off events. [2023-11-30 06:22:17,651 INFO L125 PetriNetUnfolderBase]: For 8372/8970 co-relation queries the response was YES. [2023-11-30 06:22:17,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10641 conditions, 2522 events. 1180/2522 cut-off events. For 8372/8970 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 19600 event pairs, 420 based on Foata normal form. 15/1446 useless extension candidates. Maximal degree in co-relation 10602. Up to 1120 conditions per place. [2023-11-30 06:22:17,741 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 92 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2023-11-30 06:22:17,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2023-11-30 06:22:17,742 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-30 06:22:17,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 340 transitions. [2023-11-30 06:22:17,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 340 transitions. [2023-11-30 06:22:17,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:17,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 340 transitions. [2023-11-30 06:22:17,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 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 06:22:17,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:17,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:17,745 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 13 predicate places. [2023-11-30 06:22:17,745 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:17,745 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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 06:22:17,745 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:17,745 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:17,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 06:22:17,745 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:17,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1508574190, now seen corresponding path program 1 times [2023-11-30 06:22:17,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:17,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140063947] [2023-11-30 06:22:17,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140063947] [2023-11-30 06:22:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140063947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695164934] [2023-11-30 06:22:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:17,795 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 06:22:17,825 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 06:22:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:17,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 06:22:17,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:17,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695164934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 06:22:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913457916] [2023-11-30 06:22:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:17,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 06:22:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 06:22:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:17,903 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:17,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 164 transitions, 1405 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 06:22:17,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:17,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:17,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 70#L699true, 103#true, 48#L704-7true, 92#true]) [2023-11-30 06:22:18,131 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 48#L704-7true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:18,131 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 48#L704-7true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:18,131 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][149], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 39#L696-8true, 80#L707true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:18,136 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][150], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 105#(<= ~i~0 3), 92#true]) [2023-11-30 06:22:18,136 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][151], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 39#L696-8true, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 109#(<= 3 ~i~0), 92#true]) [2023-11-30 06:22:18,136 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,136 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][152], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 96#true, 80#L707true, 107#true, 103#true, 118#true, 92#true]) [2023-11-30 06:22:18,137 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][153], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 14#L701true, 96#true, 107#true, 105#(<= ~i~0 3), 118#true, 92#true]) [2023-11-30 06:22:18,137 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][154], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 14#L701true, 88#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 109#(<= 3 ~i~0), 118#true, 92#true]) [2023-11-30 06:22:18,137 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,137 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][149], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 96#true, 80#L707true, 107#true, 103#true, 52#L697true, 92#true]) [2023-11-30 06:22:18,138 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([233] L705-->t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~i~0_13) 0) InVars {~i~0=v_~i~0_13} OutVars{~i~0=v_~i~0_13} AuxVars[] AssignedVars[][150], [111#true, 24#L717true, 18#t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 105#(<= ~i~0 3), 52#L697true, 92#true]) [2023-11-30 06:22:18,138 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,138 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][151], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 109#(<= 3 ~i~0), 52#L697true, 92#true]) [2023-11-30 06:22:18,139 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 96#true, 70#L699true, 107#true, 103#true, 92#true]) [2023-11-30 06:22:18,139 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:18,139 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 42#L705true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:18,140 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:18,140 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,140 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 96#true, 103#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 94#(<= ~j~0 6)]) [2023-11-30 06:22:18,141 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 20#L704-8true, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:18,141 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,141 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][140], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 70#L699true, 107#true, 96#true, 103#true, 92#true]) [2023-11-30 06:22:18,143 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([215] L697-->t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483649 v_~j~0_19) 0) InVars {~j~0=v_~j~0_19} OutVars{~j~0=v_~j~0_19} AuxVars[] AssignedVars[][141], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 44#L709true, t1Thread1of1ForFork0InUse, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 64#t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 94#(<= ~j~0 6)]) [2023-11-30 06:22:18,143 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][142], [111#true, 24#L717true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), 44#L709true, t1Thread1of1ForFork0InUse, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 96#true, 107#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 92#true]) [2023-11-30 06:22:18,143 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,148 INFO L124 PetriNetUnfolderBase]: 1136/2463 cut-off events. [2023-11-30 06:22:18,148 INFO L125 PetriNetUnfolderBase]: For 11105/13189 co-relation queries the response was YES. [2023-11-30 06:22:18,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11761 conditions, 2463 events. 1136/2463 cut-off events. For 11105/13189 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 19081 event pairs, 321 based on Foata normal form. 98/1553 useless extension candidates. Maximal degree in co-relation 11720. Up to 1107 conditions per place. [2023-11-30 06:22:18,172 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 102 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-11-30 06:22:18,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 06:22:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 06:22:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 468 transitions. [2023-11-30 06:22:18,173 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 06:22:18,173 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 468 transitions. [2023-11-30 06:22:18,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 468 transitions. [2023-11-30 06:22:18,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 468 transitions. [2023-11-30 06:22:18,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 66.85714285714286) internal successors, (468), 7 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 06:22:18,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 06:22:18,175 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 06:22:18,176 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2023-11-30 06:22:18,176 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:18,176 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 06:22:18,176 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,176 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] [2023-11-30 06:22:18,187 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 06:22:18,382 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:18,382 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:18,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash -468909232, now seen corresponding path program 1 times [2023-11-30 06:22:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604825258] [2023-11-30 06:22:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,430 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 06:22:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604825258] [2023-11-30 06:22:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604825258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583022357] [2023-11-30 06:22:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:18,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:18,432 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:18,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 177 transitions, 1821 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:18,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:18,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:18,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 70#L699true, 107#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 48#L704-7true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,632 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 48#L704-7true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,632 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,632 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 80#L707true, 107#true, 52#L697true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,642 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,642 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,642 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 109#(<= 3 ~i~0), 52#L697true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,643 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 80#L707true, 107#true, 53#L696-7true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,643 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 53#L696-7true, 109#(<= 3 ~i~0), t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,643 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,643 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][166], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, 80#L707true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,644 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][167], [111#true, 24#L717true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 109#(<= 3 ~i~0), t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 39#L696-8true, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,644 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 42#L705true, 88#true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 70#L699true, 107#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,644 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 42#L705true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,645 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L705-->L707: Formula: (and (<= v_~i~0_19 2147483646) (<= 0 (+ 2147483649 v_~i~0_19)) (= v_~j~0_13 (+ v_~i~0_19 1))) InVars {~i~0=v_~i~0_19} OutVars{~i~0=v_~i~0_19, ~j~0=v_~j~0_13} AuxVars[] AssignedVars[~j~0][170], [111#true, 24#L717true, 14#L701true, 88#true, 107#true, 80#L707true, 118#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,645 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([234] L705-->t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~i~0_17)) (< 2147483646 v_~i~0_17)) InVars {~i~0=v_~i~0_17} OutVars{~i~0=v_~i~0_17} AuxVars[] AssignedVars[][171], [111#true, 24#L717true, 14#L701true, 88#true, 109#(<= 3 ~i~0), 118#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 35#t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,646 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 20#L704-8true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,646 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 20#L704-8true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,646 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,647 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,647 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:18,647 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:18,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L697-->L699: Formula: (and (<= v_~j~0_23 2147483646) (<= 0 (+ 2147483649 v_~j~0_23)) (= v_~i~0_23 (+ v_~j~0_23 1))) InVars {~j~0=v_~j~0_23} OutVars{~i~0=v_~i~0_23, ~j~0=v_~j~0_23} AuxVars[] AssignedVars[~i~0][133], [111#true, 24#L717true, 44#L709true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 88#true, 107#true, 70#L699true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 96#true, 103#true, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,657 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,657 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,657 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,741 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L697-->t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~j~0_21)) (< 2147483646 v_~j~0_21)) InVars {~j~0=v_~j~0_21} OutVars{~j~0=v_~j~0_21} AuxVars[] AssignedVars[][134], [111#true, 24#L717true, 44#L709true, 122#(<= 1 t1Thread1of1ForFork0_~k~0), 107#true, t2Thread1of1ForFork1InUse, 90#(<= 6 ~j~0), t1Thread1of1ForFork0InUse, 96#true, 103#true, 58#t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 228#(and (<= 7 ~i~0) (<= 6 ~j~0)), 92#true]) [2023-11-30 06:22:18,741 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,741 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,742 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:18,742 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:18,751 INFO L124 PetriNetUnfolderBase]: 1321/3048 cut-off events. [2023-11-30 06:22:18,751 INFO L125 PetriNetUnfolderBase]: For 20124/22295 co-relation queries the response was YES. [2023-11-30 06:22:18,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15632 conditions, 3048 events. 1321/3048 cut-off events. For 20124/22295 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 25735 event pairs, 224 based on Foata normal form. 5/1902 useless extension candidates. Maximal degree in co-relation 15587. Up to 1500 conditions per place. [2023-11-30 06:22:18,777 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 104 selfloop transitions, 26 changer transitions 0/204 dead transitions. [2023-11-30 06:22:18,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2023-11-30 06:22:18,779 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2023-11-30 06:22:18,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 367 transitions. [2023-11-30 06:22:18,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 367 transitions. [2023-11-30 06:22:18,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:18,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 367 transitions. [2023-11-30 06:22:18,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 06:22:18,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:18,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:18,782 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2023-11-30 06:22:18,782 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:18,782 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:18,782 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:18,782 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] [2023-11-30 06:22:18,782 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 06:22:18,782 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:18,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -468909231, now seen corresponding path program 1 times [2023-11-30 06:22:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312392376] [2023-11-30 06:22:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:18,837 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 06:22:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312392376] [2023-11-30 06:22:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312392376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165688623] [2023-11-30 06:22:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:18,838 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:18,839 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:18,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 204 transitions, 2413 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:18,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:18,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:18,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,084 INFO L124 PetriNetUnfolderBase]: 1076/2792 cut-off events. [2023-11-30 06:22:19,084 INFO L125 PetriNetUnfolderBase]: For 20445/21629 co-relation queries the response was YES. [2023-11-30 06:22:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14770 conditions, 2792 events. 1076/2792 cut-off events. For 20445/21629 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25230 event pairs, 231 based on Foata normal form. 1/1813 useless extension candidates. Maximal degree in co-relation 14721. Up to 1369 conditions per place. [2023-11-30 06:22:19,113 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 105 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2023-11-30 06:22:19,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2023-11-30 06:22:19,114 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-30 06:22:19,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 364 transitions. [2023-11-30 06:22:19,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 364 transitions. [2023-11-30 06:22:19,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 364 transitions. [2023-11-30 06:22:19,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 06:22:19,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:19,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:19,116 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:19,116 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:19,116 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:19,116 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,116 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] [2023-11-30 06:22:19,116 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 06:22:19,116 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:19,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 856139216, now seen corresponding path program 1 times [2023-11-30 06:22:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608633907] [2023-11-30 06:22:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,151 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 06:22:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608633907] [2023-11-30 06:22:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608633907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252889395] [2023-11-30 06:22:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:19,153 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:19,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 218 transitions, 2833 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:19,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:19,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,430 INFO L124 PetriNetUnfolderBase]: 968/2542 cut-off events. [2023-11-30 06:22:19,430 INFO L125 PetriNetUnfolderBase]: For 32152/33573 co-relation queries the response was YES. [2023-11-30 06:22:19,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14115 conditions, 2542 events. 968/2542 cut-off events. For 32152/33573 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21876 event pairs, 193 based on Foata normal form. 1/1745 useless extension candidates. Maximal degree in co-relation 14062. Up to 1318 conditions per place. [2023-11-30 06:22:19,455 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 110 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 06:22:19,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2023-11-30 06:22:19,457 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 06:22:19,457 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 280 transitions. [2023-11-30 06:22:19,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 280 transitions. [2023-11-30 06:22:19,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 280 transitions. [2023-11-30 06:22:19,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 06:22:19,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 06:22:19,458 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 06:22:19,459 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:19,459 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:19,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:19,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,459 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] [2023-11-30 06:22:19,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 06:22:19,459 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:19,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash 535424785, now seen corresponding path program 1 times [2023-11-30 06:22:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772754246] [2023-11-30 06:22:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,495 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 06:22:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772754246] [2023-11-30 06:22:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772754246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915492945] [2023-11-30 06:22:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:19,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:19,497 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:19,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 186 transitions, 2507 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:19,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:19,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:19,773 INFO L124 PetriNetUnfolderBase]: 1017/2712 cut-off events. [2023-11-30 06:22:19,773 INFO L125 PetriNetUnfolderBase]: For 47302/49890 co-relation queries the response was YES. [2023-11-30 06:22:19,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16078 conditions, 2712 events. 1017/2712 cut-off events. For 47302/49890 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23440 event pairs, 180 based on Foata normal form. 5/1884 useless extension candidates. Maximal degree in co-relation 16021. Up to 1399 conditions per place. [2023-11-30 06:22:19,809 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 105 selfloop transitions, 15 changer transitions 0/194 dead transitions. [2023-11-30 06:22:19,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2023-11-30 06:22:19,811 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2023-11-30 06:22:19,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 361 transitions. [2023-11-30 06:22:19,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 361 transitions. [2023-11-30 06:22:19,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:19,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 361 transitions. [2023-11-30 06:22:19,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 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 06:22:19,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:19,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:19,814 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 30 predicate places. [2023-11-30 06:22:19,814 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 194 transitions, 2903 flow [2023-11-30 06:22:19,815 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 06:22:19,815 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:19,815 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:19,815 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 06:22:19,815 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:19,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash -478840111, now seen corresponding path program 1 times [2023-11-30 06:22:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922053336] [2023-11-30 06:22:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 06:22:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922053336] [2023-11-30 06:22:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922053336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603216172] [2023-11-30 06:22:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:19,848 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:19,849 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:19,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 194 transitions, 2903 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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 06:22:19,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:19,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:19,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:20,118 INFO L124 PetriNetUnfolderBase]: 894/2410 cut-off events. [2023-11-30 06:22:20,119 INFO L125 PetriNetUnfolderBase]: For 46160/50019 co-relation queries the response was YES. [2023-11-30 06:22:20,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15677 conditions, 2410 events. 894/2410 cut-off events. For 46160/50019 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20922 event pairs, 148 based on Foata normal form. 338/2074 useless extension candidates. Maximal degree in co-relation 15618. Up to 1245 conditions per place. [2023-11-30 06:22:20,150 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 120 selfloop transitions, 8 changer transitions 0/211 dead transitions. [2023-11-30 06:22:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2023-11-30 06:22:20,152 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2023-11-30 06:22:20,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 326 transitions. [2023-11-30 06:22:20,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 326 transitions. [2023-11-30 06:22:20,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:20,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 326 transitions. [2023-11-30 06:22:20,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 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 06:22:20,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:20,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:20,154 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2023-11-30 06:22:20,155 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 211 transitions, 3591 flow [2023-11-30 06:22:20,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 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 06:22:20,155 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:20,155 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:20,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 06:22:20,155 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:20,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1696098036, now seen corresponding path program 1 times [2023-11-30 06:22:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638285581] [2023-11-30 06:22:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638285581] [2023-11-30 06:22:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638285581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058182302] [2023-11-30 06:22:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:20,286 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 06:22:20,304 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 06:22:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:20,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:20,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058182302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 06:22:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012134378] [2023-11-30 06:22:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 06:22:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 06:22:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 06:22:20,389 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:20,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 211 transitions, 3591 flow. Second operand has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 06:22:20,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:20,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:20,637 INFO L124 PetriNetUnfolderBase]: 919/2364 cut-off events. [2023-11-30 06:22:20,637 INFO L125 PetriNetUnfolderBase]: For 42403/45887 co-relation queries the response was YES. [2023-11-30 06:22:20,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17392 conditions, 2364 events. 919/2364 cut-off events. For 42403/45887 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20036 event pairs, 69 based on Foata normal form. 108/1841 useless extension candidates. Maximal degree in co-relation 17331. Up to 1221 conditions per place. [2023-11-30 06:22:20,664 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 139 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2023-11-30 06:22:20,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2023-11-30 06:22:20,665 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2023-11-30 06:22:20,665 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 261 transitions. [2023-11-30 06:22:20,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 261 transitions. [2023-11-30 06:22:20,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:20,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 261 transitions. [2023-11-30 06:22:20,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 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 06:22:20,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 06:22:20,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 06:22:20,667 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 35 predicate places. [2023-11-30 06:22:20,667 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 226 transitions, 4293 flow [2023-11-30 06:22:20,667 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 06:22:20,667 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:20,667 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 06:22:20,674 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 06:22:20,872 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,SelfDestructingSolverStorable12 [2023-11-30 06:22:20,873 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:20,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1039431291, now seen corresponding path program 1 times [2023-11-30 06:22:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547732498] [2023-11-30 06:22:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:20,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 06:22:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547732498] [2023-11-30 06:22:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547732498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086989941] [2023-11-30 06:22:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:20,901 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:20,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:20,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:20,902 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:20,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 226 transitions, 4293 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 06:22:20,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:20,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:20,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:21,177 INFO L124 PetriNetUnfolderBase]: 950/2488 cut-off events. [2023-11-30 06:22:21,177 INFO L125 PetriNetUnfolderBase]: For 46171/50517 co-relation queries the response was YES. [2023-11-30 06:22:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19402 conditions, 2488 events. 950/2488 cut-off events. For 46171/50517 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20610 event pairs, 69 based on Foata normal form. 224/2162 useless extension candidates. Maximal degree in co-relation 19339. Up to 1206 conditions per place. [2023-11-30 06:22:21,203 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 152 selfloop transitions, 8 changer transitions 0/241 dead transitions. [2023-11-30 06:22:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2023-11-30 06:22:21,204 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2023-11-30 06:22:21,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 323 transitions. [2023-11-30 06:22:21,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 323 transitions. [2023-11-30 06:22:21,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:21,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 323 transitions. [2023-11-30 06:22:21,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 06:22:21,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:21,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 06:22:21,206 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 38 predicate places. [2023-11-30 06:22:21,206 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 241 transitions, 5055 flow [2023-11-30 06:22:21,206 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 06:22:21,206 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:21,207 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:21,207 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 06:22:21,207 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:21,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1709195249, now seen corresponding path program 1 times [2023-11-30 06:22:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622432942] [2023-11-30 06:22:21,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,257 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 06:22:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622432942] [2023-11-30 06:22:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622432942] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805243577] [2023-11-30 06:22:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:21,282 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 06:22:21,309 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 06:22:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:22:21,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:21,364 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 06:22:21,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:21,402 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 06:22:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805243577] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:21,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-30 06:22:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006996488] [2023-11-30 06:22:21,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:21,403 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 06:22:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 06:22:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:21,403 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:21,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 241 transitions, 5055 flow. Second operand has 8 states, 8 states have (on average 68.625) internal successors, (549), 8 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:21,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:21,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:21,666 INFO L124 PetriNetUnfolderBase]: 1017/2746 cut-off events. [2023-11-30 06:22:21,666 INFO L125 PetriNetUnfolderBase]: For 69817/75073 co-relation queries the response was YES. [2023-11-30 06:22:21,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22247 conditions, 2746 events. 1017/2746 cut-off events. For 69817/75073 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 21634 event pairs, 61 based on Foata normal form. 22/2259 useless extension candidates. Maximal degree in co-relation 22180. Up to 1455 conditions per place. [2023-11-30 06:22:21,697 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 145 selfloop transitions, 73 changer transitions 0/289 dead transitions. [2023-11-30 06:22:21,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 06:22:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 06:22:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 573 transitions. [2023-11-30 06:22:21,698 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8526785714285714 [2023-11-30 06:22:21,698 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 573 transitions. [2023-11-30 06:22:21,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 573 transitions. [2023-11-30 06:22:21,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:21,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 573 transitions. [2023-11-30 06:22:21,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.625) internal successors, (573), 8 states have internal predecessors, (573), 0 states have call successors, (0), 0 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 06:22:21,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,701 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,701 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2023-11-30 06:22:21,701 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 289 transitions, 6771 flow [2023-11-30 06:22:21,701 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.625) internal successors, (549), 8 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:21,701 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:21,701 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 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] [2023-11-30 06:22:21,708 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 06:22:21,906 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:21,906 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:21,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:21,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1856336227, now seen corresponding path program 1 times [2023-11-30 06:22:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:21,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566552076] [2023-11-30 06:22:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:21,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566552076] [2023-11-30 06:22:21,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566552076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:21,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805102949] [2023-11-30 06:22:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:21,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:21,973 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 06:22:21,999 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 06:22:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:22,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 06:22:22,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:22,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805102949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:22,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-30 06:22:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272412748] [2023-11-30 06:22:22,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:22,130 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 06:22:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 06:22:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-30 06:22:22,131 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:22,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 289 transitions, 6771 flow. Second operand has 12 states, 12 states have (on average 68.5) internal successors, (822), 12 states have internal predecessors, (822), 0 states have call successors, (0), 0 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 06:22:22,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:22,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:22,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:22,586 INFO L124 PetriNetUnfolderBase]: 1260/3352 cut-off events. [2023-11-30 06:22:22,587 INFO L125 PetriNetUnfolderBase]: For 121991/130499 co-relation queries the response was YES. [2023-11-30 06:22:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28740 conditions, 3352 events. 1260/3352 cut-off events. For 121991/130499 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 24960 event pairs, 88 based on Foata normal form. 28/2808 useless extension candidates. Maximal degree in co-relation 28669. Up to 1845 conditions per place. [2023-11-30 06:22:22,619 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 168 selfloop transitions, 103 changer transitions 0/342 dead transitions. [2023-11-30 06:22:22,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 06:22:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 06:22:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 930 transitions. [2023-11-30 06:22:22,621 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2023-11-30 06:22:22,622 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 930 transitions. [2023-11-30 06:22:22,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 930 transitions. [2023-11-30 06:22:22,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:22,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 930 transitions. [2023-11-30 06:22:22,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.53846153846153) internal successors, (930), 13 states have internal predecessors, (930), 0 states have call successors, (0), 0 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 06:22:22,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 84.0) internal successors, (1176), 14 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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 06:22:22,625 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 84.0) internal successors, (1176), 14 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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 06:22:22,625 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 57 predicate places. [2023-11-30 06:22:22,625 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 342 transitions, 8865 flow [2023-11-30 06:22:22,625 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.5) internal successors, (822), 12 states have internal predecessors, (822), 0 states have call successors, (0), 0 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 06:22:22,625 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:22,626 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 06:22:22,646 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 06:22:22,844 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 06:22:22,845 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:22,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1596023075, now seen corresponding path program 1 times [2023-11-30 06:22:22,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:22,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833130302] [2023-11-30 06:22:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833130302] [2023-11-30 06:22:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833130302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225151000] [2023-11-30 06:22:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:22,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:22,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:22,957 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 06:22:22,985 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 06:22:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:23,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 06:22:23,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:23,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225151000] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:23,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:23,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-30 06:22:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295694465] [2023-11-30 06:22:23,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:23,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 06:22:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 06:22:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-30 06:22:23,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:23,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 342 transitions, 8865 flow. Second operand has 16 states, 16 states have (on average 68.3125) internal successors, (1093), 16 states have internal predecessors, (1093), 0 states have call successors, (0), 0 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 06:22:23,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:23,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:23,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:23,900 INFO L124 PetriNetUnfolderBase]: 1836/5182 cut-off events. [2023-11-30 06:22:23,900 INFO L125 PetriNetUnfolderBase]: For 207169/218692 co-relation queries the response was YES. [2023-11-30 06:22:23,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44629 conditions, 5182 events. 1836/5182 cut-off events. For 207169/218692 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 39599 event pairs, 163 based on Foata normal form. 13/4377 useless extension candidates. Maximal degree in co-relation 44554. Up to 2913 conditions per place. [2023-11-30 06:22:24,104 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 239 selfloop transitions, 151 changer transitions 1/462 dead transitions. [2023-11-30 06:22:24,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 06:22:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 06:22:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1141 transitions. [2023-11-30 06:22:24,106 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2023-11-30 06:22:24,106 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1141 transitions. [2023-11-30 06:22:24,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1141 transitions. [2023-11-30 06:22:24,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:24,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1141 transitions. [2023-11-30 06:22:24,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 71.3125) internal successors, (1141), 16 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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 06:22:24,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 84.0) internal successors, (1428), 17 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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 06:22:24,111 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 84.0) internal successors, (1428), 17 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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 06:22:24,111 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 72 predicate places. [2023-11-30 06:22:24,111 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 462 transitions, 13407 flow [2023-11-30 06:22:24,112 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 68.3125) internal successors, (1093), 16 states have internal predecessors, (1093), 0 states have call successors, (0), 0 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 06:22:24,113 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:24,113 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 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 06:22:24,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-30 06:22:24,318 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,SelfDestructingSolverStorable16 [2023-11-30 06:22:24,318 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:24,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495049, now seen corresponding path program 2 times [2023-11-30 06:22:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264235142] [2023-11-30 06:22:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264235142] [2023-11-30 06:22:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264235142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921860520] [2023-11-30 06:22:24,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:24,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:24,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:24,511 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 06:22:24,532 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 06:22:24,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:24,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:24,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-30 06:22:24,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:24,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921860520] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:24,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-11-30 06:22:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603497449] [2023-11-30 06:22:24,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:24,919 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 06:22:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 06:22:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-11-30 06:22:24,921 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:24,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 462 transitions, 13407 flow. Second operand has 28 states, 28 states have (on average 68.21428571428571) internal successors, (1910), 28 states have internal predecessors, (1910), 0 states have call successors, (0), 0 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 06:22:24,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:24,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:24,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:26,561 INFO L124 PetriNetUnfolderBase]: 3068/8044 cut-off events. [2023-11-30 06:22:26,562 INFO L125 PetriNetUnfolderBase]: For 438275/461720 co-relation queries the response was YES. [2023-11-30 06:22:26,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76094 conditions, 8044 events. 3068/8044 cut-off events. For 438275/461720 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 58868 event pairs, 228 based on Foata normal form. 20/6737 useless extension candidates. Maximal degree in co-relation 76015. Up to 4692 conditions per place. [2023-11-30 06:22:26,677 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 392 selfloop transitions, 263 changer transitions 0/726 dead transitions. [2023-11-30 06:22:26,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-30 06:22:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-30 06:22:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2071 transitions. [2023-11-30 06:22:26,681 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8501642036124795 [2023-11-30 06:22:26,681 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:26,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2071 transitions. [2023-11-30 06:22:26,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 71.41379310344827) internal successors, (2071), 29 states have internal predecessors, (2071), 0 states have call successors, (0), 0 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 06:22:26,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 84.0) internal successors, (2520), 30 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,688 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 84.0) internal successors, (2520), 30 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:22:26,689 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 100 predicate places. [2023-11-30 06:22:26,689 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 726 transitions, 23517 flow [2023-11-30 06:22:26,689 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 68.21428571428571) internal successors, (1910), 28 states have internal predecessors, (1910), 0 states have call successors, (0), 0 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 06:22:26,689 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:26,689 INFO L232 CegarLoopForPetriNet]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 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 06:22:26,696 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 06:22:26,891 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 06:22:26,892 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:22:26,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996361, now seen corresponding path program 2 times [2023-11-30 06:22:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256039325] [2023-11-30 06:22:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:22:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256039325] [2023-11-30 06:22:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256039325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071439211] [2023-11-30 06:22:27,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:22:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:27,511 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 06:22:27,513 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 06:22:27,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:22:27,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:22:27,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 06:22:27,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 716 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 06:22:28,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:22:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 716 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 06:22:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071439211] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:22:28,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:22:28,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2023-11-30 06:22:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067151800] [2023-11-30 06:22:28,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:22:28,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-30 06:22:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-30 06:22:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2023-11-30 06:22:28,520 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2023-11-30 06:22:28,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 726 transitions, 23517 flow. Second operand has 46 states, 46 states have (on average 60.08695652173913) internal successors, (2764), 46 states have internal predecessors, (2764), 0 states have call successors, (0), 0 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 06:22:28,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:28,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2023-11-30 06:22:28,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:49,396 INFO L124 PetriNetUnfolderBase]: 15829/48055 cut-off events. [2023-11-30 06:22:49,396 INFO L125 PetriNetUnfolderBase]: For 1524940/1568869 co-relation queries the response was YES. [2023-11-30 06:22:49,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389049 conditions, 48055 events. 15829/48055 cut-off events. For 1524940/1568869 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 546898 event pairs, 402 based on Foata normal form. 2666/46005 useless extension candidates. Maximal degree in co-relation 388966. Up to 27923 conditions per place. [2023-11-30 06:22:49,882 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 0 selfloop transitions, 0 changer transitions 4389/4389 dead transitions. [2023-11-30 06:22:49,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 4389 transitions, 122394 flow [2023-11-30 06:22:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 437 states. [2023-11-30 06:22:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2023-11-30 06:22:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 26855 transitions. [2023-11-30 06:22:49,952 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7315843957720388 [2023-11-30 06:22:49,953 INFO L72 ComplementDD]: Start complementDD. Operand 437 states and 26855 transitions. [2023-11-30 06:22:49,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 437 states and 26855 transitions. [2023-11-30 06:22:49,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:49,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 437 states and 26855 transitions. [2023-11-30 06:22:50,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 438 states, 437 states have (on average 61.453089244851256) internal successors, (26855), 437 states have internal predecessors, (26855), 0 states have call successors, (0), 0 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 06:22:50,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 438 states, 438 states have (on average 84.0) internal successors, (36792), 438 states have internal predecessors, (36792), 0 states have call successors, (0), 0 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 06:22:50,069 INFO L81 ComplementDD]: Finished complementDD. Result has 438 states, 438 states have (on average 84.0) internal successors, (36792), 438 states have internal predecessors, (36792), 0 states have call successors, (0), 0 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 06:22:50,070 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 531 predicate places. [2023-11-30 06:22:50,071 INFO L500 AbstractCegarLoop]: Abstraction has has 614 places, 4389 transitions, 122394 flow [2023-11-30 06:22:50,071 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 60.08695652173913) internal successors, (2764), 46 states have internal predecessors, (2764), 0 states have call successors, (0), 0 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 06:22:50,075 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longer-2.i_BEv2_AllErrorsAtOnce [2023-11-30 06:22:50,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-11-30 06:22:50,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-11-30 06:22:50,145 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-11-30 06:22:50,152 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 06:22:50,351 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 06:22:50,352 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:22:50,356 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 06:22:50,356 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 06:22:50,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 06:22:50 BasicIcfg [2023-11-30 06:22:50,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 06:22:50,364 INFO L158 Benchmark]: Toolchain (without parser) took 35342.00ms. Allocated memory was 530.6MB in the beginning and 8.5GB in the end (delta: 8.0GB). Free memory was 495.0MB in the beginning and 7.4GB in the end (delta: -6.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-11-30 06:22:50,364 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory was 326.8MB in the beginning and 326.6MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:22:50,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.18ms. Allocated memory is still 530.6MB. Free memory was 495.0MB in the beginning and 475.4MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 06:22:50,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.23ms. Allocated memory is still 530.6MB. Free memory was 475.4MB in the beginning and 473.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:22:50,364 INFO L158 Benchmark]: Boogie Preprocessor took 29.71ms. Allocated memory is still 530.6MB. Free memory was 473.3MB in the beginning and 472.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:22:50,364 INFO L158 Benchmark]: RCFGBuilder took 354.54ms. Allocated memory is still 530.6MB. Free memory was 472.1MB in the beginning and 457.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 06:22:50,365 INFO L158 Benchmark]: TraceAbstraction took 34523.53ms. Allocated memory was 530.6MB in the beginning and 8.5GB in the end (delta: 8.0GB). Free memory was 456.0MB in the beginning and 7.4GB in the end (delta: -7.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-11-30 06:22:50,365 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 371.2MB. Free memory was 326.8MB in the beginning and 326.6MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 388.18ms. Allocated memory is still 530.6MB. Free memory was 495.0MB in the beginning and 475.4MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.23ms. Allocated memory is still 530.6MB. Free memory was 475.4MB in the beginning and 473.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.71ms. Allocated memory is still 530.6MB. Free memory was 473.3MB in the beginning and 472.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 354.54ms. Allocated memory is still 530.6MB. Free memory was 472.1MB in the beginning and 457.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 34523.53ms. Allocated memory was 530.6MB in the beginning and 8.5GB in the end (delta: 8.0GB). Free memory was 456.0MB in the beginning and 7.4GB in the end (delta: -7.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.4s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3528 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3528 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3100 IncrementalHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 63 mSDtfsCounter, 3100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 899 SyntacticMatches, 20 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111435 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122394occurred in iteration=19, InterpolantAutomatonStates: 565, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1798 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1484/3002 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 06:22:50,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...