/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-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 06:22:53,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 06:22:53,889 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:53,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 06:22:53,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 06:22:53,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 06:22:53,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 06:22:53,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 06:22:53,918 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 06:22:53,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 06:22:53,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 06:22:53,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 06:22:53,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 06:22:53,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 06:22:53,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 06:22:53,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 06:22:53,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 06:22:53,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 06:22:53,925 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 06:22:53,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 06:22:53,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:53,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 06:22:53,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 06:22:53,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 06:22:53,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 06:22:53,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 06:22:53,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 06:22:53,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 06:22:53,928 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:54,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 06:22:54,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 06:22:54,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 06:22:54,117 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 06:22:54,117 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 06:22:54,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2023-11-30 06:22:55,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 06:22:55,384 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 06:22:55,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2023-11-30 06:22:55,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b18c169e/a284dbc935b44371a40329d5ccaf04c7/FLAGb1bcb4cb2 [2023-11-30 06:22:55,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b18c169e/a284dbc935b44371a40329d5ccaf04c7 [2023-11-30 06:22:55,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 06:22:55,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 06:22:55,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:55,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 06:22:55,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 06:22:55,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:55" (1/1) ... [2023-11-30 06:22:55,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6965253f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:55, skipping insertion in model container [2023-11-30 06:22:55,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 06:22:55" (1/1) ... [2023-11-30 06:22:55,458 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 06:22:55,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:55,723 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 06:22:55,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 06:22:55,782 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:55,782 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 06:22:55,787 INFO L206 MainTranslator]: Completed translation [2023-11-30 06:22:55,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:55 WrapperNode [2023-11-30 06:22:55,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 06:22:55,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:55,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 06:22:55,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 06:22:55,793 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:55" (1/1) ... [2023-11-30 06:22:55,815 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:55" (1/1) ... [2023-11-30 06:22:55,830 INFO L138 Inliner]: procedures = 169, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-11-30 06:22:55,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 06:22:55,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 06:22:55,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 06:22:55,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 06:22:55,836 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:55" (1/1) ... [2023-11-30 06:22:55,836 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:55" (1/1) ... [2023-11-30 06:22:55,841 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:55" (1/1) ... [2023-11-30 06:22:55,841 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:55" (1/1) ... [2023-11-30 06:22:55,854 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:55" (1/1) ... [2023-11-30 06:22:55,856 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:55" (1/1) ... [2023-11-30 06:22:55,857 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:55" (1/1) ... [2023-11-30 06:22:55,861 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:55" (1/1) ... [2023-11-30 06:22:55,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 06:22:55,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 06:22:55,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 06:22:55,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 06:22:55,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:55" (1/1) ... [2023-11-30 06:22:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 06:22:55,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:55,885 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:55,917 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:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 06:22:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 06:22:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 06:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 06:22:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 06:22:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 06:22:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 06:22:55,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 06:22:55,923 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:56,042 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 06:22:56,044 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 06:22:56,173 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 06:22:56,192 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 06:22:56,192 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 06:22:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:56 BoogieIcfgContainer [2023-11-30 06:22:56,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 06:22:56,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 06:22:56,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 06:22:56,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 06:22:56,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 06:22:55" (1/3) ... [2023-11-30 06:22:56,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792c01e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:56, skipping insertion in model container [2023-11-30 06:22:56,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 06:22:55" (2/3) ... [2023-11-30 06:22:56,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792c01e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 06:22:56, skipping insertion in model container [2023-11-30 06:22:56,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 06:22:56" (3/3) ... [2023-11-30 06:22:56,199 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2023-11-30 06:22:56,210 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 06:22:56,210 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 06:22:56,210 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 06:22:56,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 06:22:56,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:56,301 INFO L124 PetriNetUnfolderBase]: 6/82 cut-off events. [2023-11-30 06:22:56,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:56,306 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:56,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 84 transitions, 176 flow [2023-11-30 06:22:56,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 170 flow [2023-11-30 06:22:56,314 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 06:22:56,319 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;@490de13f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 06:22:56,319 INFO L363 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-30 06:22:56,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 06:22:56,325 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-30 06:22:56,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 06:22:56,325 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:56,326 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:56,326 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:56,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -184951082, now seen corresponding path program 1 times [2023-11-30 06:22:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069640717] [2023-11-30 06:22:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:56,541 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:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:56,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069640717] [2023-11-30 06:22:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069640717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313832771] [2023-11-30 06:22:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:56,549 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:56,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:56,572 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:56,574 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:56,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:56,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:56,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:56,644 INFO L124 PetriNetUnfolderBase]: 90/315 cut-off events. [2023-11-30 06:22:56,644 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 06:22:56,646 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:56,649 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-30 06:22:56,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-30 06:22:56,657 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2023-11-30 06:22:56,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-30 06:22:56,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-30 06:22:56,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:56,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-30 06:22:56,662 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:56,665 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:56,665 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:56,667 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2023-11-30 06:22:56,668 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2023-11-30 06:22:56,668 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:56,668 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:56,668 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:56,668 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 06:22:56,668 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:56,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -184951081, now seen corresponding path program 1 times [2023-11-30 06:22:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906473491] [2023-11-30 06:22:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:56,727 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:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906473491] [2023-11-30 06:22:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906473491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468106549] [2023-11-30 06:22:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:56,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:56,731 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:56,731 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:56,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:56,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:56,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:56,837 INFO L124 PetriNetUnfolderBase]: 75/327 cut-off events. [2023-11-30 06:22:56,837 INFO L125 PetriNetUnfolderBase]: For 33/61 co-relation queries the response was YES. [2023-11-30 06:22:56,840 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:56,842 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 19 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-11-30 06:22:56,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-30 06:22:56,847 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2023-11-30 06:22:56,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-30 06:22:56,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-30 06:22:56,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:56,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-30 06:22:56,850 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:56,852 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:56,852 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:56,853 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-11-30 06:22:56,853 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 274 flow [2023-11-30 06:22:56,853 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:56,853 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:56,853 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:56,853 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 06:22:56,854 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:56,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1644321734, now seen corresponding path program 1 times [2023-11-30 06:22:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387849303] [2023-11-30 06:22:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:56,970 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:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387849303] [2023-11-30 06:22:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387849303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344441088] [2023-11-30 06:22:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:56,971 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:56,972 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:56,973 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:56,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:56,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:56,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:57,128 INFO L124 PetriNetUnfolderBase]: 317/874 cut-off events. [2023-11-30 06:22:57,132 INFO L125 PetriNetUnfolderBase]: For 423/565 co-relation queries the response was YES. [2023-11-30 06:22:57,135 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:57,141 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 62 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-11-30 06:22:57,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2023-11-30 06:22:57,142 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-11-30 06:22:57,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 343 transitions. [2023-11-30 06:22:57,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 343 transitions. [2023-11-30 06:22:57,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:57,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 343 transitions. [2023-11-30 06:22:57,143 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:57,145 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:57,145 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:57,146 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2023-11-30 06:22:57,146 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 125 transitions, 613 flow [2023-11-30 06:22:57,146 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:57,147 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:57,147 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:57,147 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 06:22:57,147 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:57,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346421, now seen corresponding path program 1 times [2023-11-30 06:22:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522443730] [2023-11-30 06:22:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:57,234 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:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522443730] [2023-11-30 06:22:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522443730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293727424] [2023-11-30 06:22:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:57,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:57,241 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:57,241 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:57,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:57,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:57,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:57,365 INFO L124 PetriNetUnfolderBase]: 479/1478 cut-off events. [2023-11-30 06:22:57,365 INFO L125 PetriNetUnfolderBase]: For 1228/1455 co-relation queries the response was YES. [2023-11-30 06:22:57,368 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:57,375 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:57,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-30 06:22:57,376 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2023-11-30 06:22:57,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-30 06:22:57,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-30 06:22:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:57,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-30 06:22:57,377 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:57,378 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:57,378 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:57,379 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2023-11-30 06:22:57,379 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 138 transitions, 845 flow [2023-11-30 06:22:57,380 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:57,380 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:57,380 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:57,380 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 06:22:57,380 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:57,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2014346422, now seen corresponding path program 1 times [2023-11-30 06:22:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555695206] [2023-11-30 06:22:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:57,445 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:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555695206] [2023-11-30 06:22:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555695206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 06:22:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935363960] [2023-11-30 06:22:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:57,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 06:22:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 06:22:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 06:22:57,447 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 84 [2023-11-30 06:22:57,448 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:57,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:57,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 84 [2023-11-30 06:22:57,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:57,600 INFO L124 PetriNetUnfolderBase]: 482/1304 cut-off events. [2023-11-30 06:22:57,600 INFO L125 PetriNetUnfolderBase]: For 1939/2254 co-relation queries the response was YES. [2023-11-30 06:22:57,603 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:57,612 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 49 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2023-11-30 06:22:57,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 06:22:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 06:22:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-30 06:22:57,613 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-30 06:22:57,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-30 06:22:57,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-30 06:22:57,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:57,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-30 06:22:57,614 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:57,615 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:57,615 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:57,617 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2023-11-30 06:22:57,617 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 138 transitions, 961 flow [2023-11-30 06:22:57,617 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:57,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:57,618 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:57,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 06:22:57,618 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:57,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1243348462, now seen corresponding path program 1 times [2023-11-30 06:22:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454460229] [2023-11-30 06:22:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:57,688 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:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454460229] [2023-11-30 06:22:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454460229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:57,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992825920] [2023-11-30 06:22:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:57,692 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:57,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:57,694 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:57,695 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:57,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:57,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:57,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:57,989 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:57,989 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,989 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,990 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,990 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,990 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:57,990 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,990 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,990 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,990 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,991 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:57,991 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,991 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,991 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:57,991 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:57,995 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:57,996 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,996 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:57,996 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,996 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:57,996 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,996 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,997 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:57,997 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 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:57,997 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,997 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,997 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:57,998 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,998 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:57,998 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:57,998 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:57,999 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:57,999 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,000 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:58,000 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,000 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,001 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:58,001 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,001 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:58,001 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,001 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,001 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:58,002 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,002 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:58,002 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,002 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:58,002 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,002 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,003 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:58,003 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,003 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,003 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,003 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,004 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:58,005 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 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:58,005 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,005 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:58,005 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,005 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,006 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,009 INFO L124 PetriNetUnfolderBase]: 1180/2522 cut-off events. [2023-11-30 06:22:58,009 INFO L125 PetriNetUnfolderBase]: For 8372/8970 co-relation queries the response was YES. [2023-11-30 06:22:58,014 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:58,033 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 92 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2023-11-30 06:22:58,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2023-11-30 06:22:58,036 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-30 06:22:58,036 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 340 transitions. [2023-11-30 06:22:58,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 340 transitions. [2023-11-30 06:22:58,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:58,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 340 transitions. [2023-11-30 06:22:58,037 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:58,038 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:58,039 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:58,041 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 13 predicate places. [2023-11-30 06:22:58,041 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 164 transitions, 1405 flow [2023-11-30 06:22:58,041 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:58,041 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:58,041 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:58,041 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 06:22:58,041 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:58,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1508574190, now seen corresponding path program 1 times [2023-11-30 06:22:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015103062] [2023-11-30 06:22:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:58,122 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:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015103062] [2023-11-30 06:22:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015103062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:22:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339833957] [2023-11-30 06:22:58,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:22:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:22:58,152 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:58,199 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:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:58,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 06:22:58,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:22:58,294 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:58,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:22:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339833957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:22:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 06:22:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722767433] [2023-11-30 06:22:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:58,295 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 06:22:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 06:22:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:22:58,296 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:22:58,296 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:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:22:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:58,547 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:58,548 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,548 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:58,548 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,548 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,548 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:58,549 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,549 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,549 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:58,549 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:58,556 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:58,557 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,557 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:58,557 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,557 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,557 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:58,557 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,558 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:58,558 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,558 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:58,558 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,558 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,559 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:58,559 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,559 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,559 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,559 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,559 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:58,559 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,559 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,559 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,560 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:58,560 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,560 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:58,560 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,560 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 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:58,561 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,561 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:58,561 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,561 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,562 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:58,562 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,562 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,562 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,562 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,562 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:58,562 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,562 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,563 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:58,563 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,563 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:58,563 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,563 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,564 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:58,564 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:58,565 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:58,566 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,566 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:58,566 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,566 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:58,566 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,566 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:58,567 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,567 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:58,571 INFO L124 PetriNetUnfolderBase]: 1136/2463 cut-off events. [2023-11-30 06:22:58,571 INFO L125 PetriNetUnfolderBase]: For 11105/13189 co-relation queries the response was YES. [2023-11-30 06:22:58,578 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:58,602 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 102 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-11-30 06:22:58,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 06:22:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 06:22:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 468 transitions. [2023-11-30 06:22:58,604 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-11-30 06:22:58,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 468 transitions. [2023-11-30 06:22:58,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 468 transitions. [2023-11-30 06:22:58,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:58,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 468 transitions. [2023-11-30 06:22:58,605 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:58,606 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:58,606 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:58,607 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2023-11-30 06:22:58,607 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 177 transitions, 1821 flow [2023-11-30 06:22:58,607 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:58,607 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:58,607 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:58,615 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:58,815 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:58,815 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:58,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -468909232, now seen corresponding path program 1 times [2023-11-30 06:22:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040777093] [2023-11-30 06:22:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:58,849 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:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040777093] [2023-11-30 06:22:58,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040777093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:58,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:58,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111063256] [2023-11-30 06:22:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:58,850 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:58,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:58,851 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:58,852 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:58,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:58,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:58,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:59,100 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:59,101 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,101 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:59,101 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,101 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,111 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:59,111 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,111 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:59,111 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,111 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:59,111 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,111 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,112 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:59,112 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-30 06:22:59,112 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:59,112 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,112 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,112 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:59,113 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 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:59,113 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,113 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:59,113 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,113 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,114 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:59,114 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,114 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:59,114 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,114 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,114 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:59,114 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,115 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:59,115 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-30 06:22:59,115 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-30 06:22:59,124 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:59,124 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,124 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:59,124 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-30 06:22:59,124 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-30 06:22:59,133 INFO L124 PetriNetUnfolderBase]: 1321/3048 cut-off events. [2023-11-30 06:22:59,133 INFO L125 PetriNetUnfolderBase]: For 20124/22295 co-relation queries the response was YES. [2023-11-30 06:22:59,141 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:59,160 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 104 selfloop transitions, 26 changer transitions 0/204 dead transitions. [2023-11-30 06:22:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2023-11-30 06:22:59,162 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2023-11-30 06:22:59,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 367 transitions. [2023-11-30 06:22:59,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 367 transitions. [2023-11-30 06:22:59,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:59,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 367 transitions. [2023-11-30 06:22:59,163 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:59,163 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:59,163 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:59,164 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2023-11-30 06:22:59,164 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 204 transitions, 2413 flow [2023-11-30 06:22:59,164 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:59,164 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:59,164 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:59,164 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 06:22:59,164 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:59,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -468909231, now seen corresponding path program 1 times [2023-11-30 06:22:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612701974] [2023-11-30 06:22:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:59,212 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:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612701974] [2023-11-30 06:22:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612701974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255428001] [2023-11-30 06:22:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:59,213 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:59,213 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:59,214 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:59,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:59,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:59,479 INFO L124 PetriNetUnfolderBase]: 1076/2792 cut-off events. [2023-11-30 06:22:59,479 INFO L125 PetriNetUnfolderBase]: For 20445/21629 co-relation queries the response was YES. [2023-11-30 06:22:59,485 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:59,499 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 105 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2023-11-30 06:22:59,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:22:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:22:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2023-11-30 06:22:59,500 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-30 06:22:59,500 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 364 transitions. [2023-11-30 06:22:59,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 364 transitions. [2023-11-30 06:22:59,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:59,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 364 transitions. [2023-11-30 06:22:59,501 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:59,502 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:59,502 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:59,502 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:59,502 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 218 transitions, 2833 flow [2023-11-30 06:22:59,503 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:59,503 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:59,503 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:59,503 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 06:22:59,503 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:59,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 856139216, now seen corresponding path program 1 times [2023-11-30 06:22:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063525443] [2023-11-30 06:22:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:59,535 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:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063525443] [2023-11-30 06:22:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063525443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:59,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47399364] [2023-11-30 06:22:59,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:59,536 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:59,537 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:59,537 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:59,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:59,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:22:59,810 INFO L124 PetriNetUnfolderBase]: 968/2542 cut-off events. [2023-11-30 06:22:59,810 INFO L125 PetriNetUnfolderBase]: For 32152/33573 co-relation queries the response was YES. [2023-11-30 06:22:59,817 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:59,836 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 110 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-11-30 06:22:59,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:22:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:22:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2023-11-30 06:22:59,837 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 06:22:59,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 280 transitions. [2023-11-30 06:22:59,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 280 transitions. [2023-11-30 06:22:59,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:22:59,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 280 transitions. [2023-11-30 06:22:59,838 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:59,839 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:59,840 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:59,841 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2023-11-30 06:22:59,841 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 186 transitions, 2507 flow [2023-11-30 06:22:59,841 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:59,841 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:22:59,841 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:59,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 06:22:59,841 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:59,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:22:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash 535424785, now seen corresponding path program 1 times [2023-11-30 06:22:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:22:59,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123124901] [2023-11-30 06:22:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:22:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:22:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:22:59,882 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:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:22:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123124901] [2023-11-30 06:22:59,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123124901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:22:59,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:22:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:22:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826022397] [2023-11-30 06:22:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:22:59,883 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:22:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:22:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:22:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:22:59,884 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:22:59,884 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:59,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:22:59,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:22:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:00,266 INFO L124 PetriNetUnfolderBase]: 1017/2712 cut-off events. [2023-11-30 06:23:00,267 INFO L125 PetriNetUnfolderBase]: For 47302/49890 co-relation queries the response was YES. [2023-11-30 06:23:00,273 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:23:00,289 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 105 selfloop transitions, 15 changer transitions 0/194 dead transitions. [2023-11-30 06:23:00,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 194 transitions, 2903 flow [2023-11-30 06:23:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:23:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:23:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2023-11-30 06:23:00,290 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2023-11-30 06:23:00,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 361 transitions. [2023-11-30 06:23:00,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 361 transitions. [2023-11-30 06:23:00,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:00,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 361 transitions. [2023-11-30 06:23:00,291 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:23:00,293 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:23:00,293 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:23:00,293 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 30 predicate places. [2023-11-30 06:23:00,293 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 194 transitions, 2903 flow [2023-11-30 06:23:00,294 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:23:00,294 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:00,294 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:23:00,294 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 06:23:00,294 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:23:00,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash -478840111, now seen corresponding path program 1 times [2023-11-30 06:23:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415027155] [2023-11-30 06:23:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:00,321 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:23:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415027155] [2023-11-30 06:23:00,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415027155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:23:00,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:23:00,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:23:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999527040] [2023-11-30 06:23:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:23:00,322 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:23:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:23:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:23:00,323 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:23:00,323 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:23:00,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:00,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:23:00,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:00,585 INFO L124 PetriNetUnfolderBase]: 894/2410 cut-off events. [2023-11-30 06:23:00,586 INFO L125 PetriNetUnfolderBase]: For 46160/50019 co-relation queries the response was YES. [2023-11-30 06:23:00,591 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:23:00,606 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 120 selfloop transitions, 8 changer transitions 0/211 dead transitions. [2023-11-30 06:23:00,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 3591 flow [2023-11-30 06:23:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:23:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:23:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2023-11-30 06:23:00,608 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2023-11-30 06:23:00,608 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 326 transitions. [2023-11-30 06:23:00,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 326 transitions. [2023-11-30 06:23:00,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:00,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 326 transitions. [2023-11-30 06:23:00,609 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:23:00,610 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:23:00,610 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:23:00,611 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2023-11-30 06:23:00,611 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 211 transitions, 3591 flow [2023-11-30 06:23:00,611 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:23:00,611 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:00,611 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:23:00,611 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 06:23:00,612 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:23:00,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1696098036, now seen corresponding path program 1 times [2023-11-30 06:23:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496830552] [2023-11-30 06:23:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:00,704 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:23:00,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:00,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496830552] [2023-11-30 06:23:00,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496830552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:00,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182250929] [2023-11-30 06:23:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:00,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:00,718 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:23:00,746 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:23:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:00,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:23:00,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:00,817 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:23:00,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 06:23:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182250929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:23:00,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 06:23:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 06:23:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931809527] [2023-11-30 06:23:00,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:23:00,818 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 06:23:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:00,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 06:23:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 06:23:00,819 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:23:00,819 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:23:00,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:00,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:23:00,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:01,132 INFO L124 PetriNetUnfolderBase]: 919/2364 cut-off events. [2023-11-30 06:23:01,133 INFO L125 PetriNetUnfolderBase]: For 42403/45887 co-relation queries the response was YES. [2023-11-30 06:23:01,139 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:23:01,160 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 139 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2023-11-30 06:23:01,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 4293 flow [2023-11-30 06:23:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 06:23:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 06:23:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2023-11-30 06:23:01,161 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2023-11-30 06:23:01,161 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 261 transitions. [2023-11-30 06:23:01,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 261 transitions. [2023-11-30 06:23:01,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:01,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 261 transitions. [2023-11-30 06:23:01,162 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:23:01,163 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:23:01,163 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:23:01,163 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 35 predicate places. [2023-11-30 06:23:01,164 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 226 transitions, 4293 flow [2023-11-30 06:23:01,164 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:23:01,164 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:01,164 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:23:01,183 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:23:01,369 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:23:01,370 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:23:01,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1039431291, now seen corresponding path program 1 times [2023-11-30 06:23:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479397995] [2023-11-30 06:23:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:01,420 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:23:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479397995] [2023-11-30 06:23:01,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479397995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 06:23:01,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 06:23:01,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 06:23:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161347030] [2023-11-30 06:23:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 06:23:01,423 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 06:23:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 06:23:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 06:23:01,425 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 84 [2023-11-30 06:23:01,425 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:23:01,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:01,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 84 [2023-11-30 06:23:01,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:01,782 INFO L124 PetriNetUnfolderBase]: 950/2488 cut-off events. [2023-11-30 06:23:01,782 INFO L125 PetriNetUnfolderBase]: For 46171/50517 co-relation queries the response was YES. [2023-11-30 06:23:01,789 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:23:01,809 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 152 selfloop transitions, 8 changer transitions 0/241 dead transitions. [2023-11-30 06:23:01,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 241 transitions, 5055 flow [2023-11-30 06:23:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 06:23:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 06:23:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2023-11-30 06:23:01,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2023-11-30 06:23:01,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 323 transitions. [2023-11-30 06:23:01,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 323 transitions. [2023-11-30 06:23:01,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:01,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 323 transitions. [2023-11-30 06:23:01,811 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:23:01,812 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:23:01,812 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:23:01,813 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 38 predicate places. [2023-11-30 06:23:01,813 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 241 transitions, 5055 flow [2023-11-30 06:23:01,813 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:23:01,813 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:01,813 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:23:01,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 06:23:01,813 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:23:01,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1709195249, now seen corresponding path program 1 times [2023-11-30 06:23:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689726045] [2023-11-30 06:23:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:01,860 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:23:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689726045] [2023-11-30 06:23:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689726045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227041527] [2023-11-30 06:23:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:01,870 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:23:01,896 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:23:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:01,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 06:23:01,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:01,983 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:23:01,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:02,030 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:23:02,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227041527] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:02,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-30 06:23:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792217078] [2023-11-30 06:23:02,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:02,033 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 06:23:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 06:23:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-30 06:23:02,034 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:23:02,034 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:23:02,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:02,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:23:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:02,440 INFO L124 PetriNetUnfolderBase]: 1017/2746 cut-off events. [2023-11-30 06:23:02,440 INFO L125 PetriNetUnfolderBase]: For 69817/75073 co-relation queries the response was YES. [2023-11-30 06:23:02,448 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:23:02,468 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 145 selfloop transitions, 73 changer transitions 0/289 dead transitions. [2023-11-30 06:23:02,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 289 transitions, 6771 flow [2023-11-30 06:23:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 06:23:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 06:23:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 573 transitions. [2023-11-30 06:23:02,470 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8526785714285714 [2023-11-30 06:23:02,470 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 573 transitions. [2023-11-30 06:23:02,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 573 transitions. [2023-11-30 06:23:02,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:02,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 573 transitions. [2023-11-30 06:23:02,471 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:23:02,472 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:23:02,473 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:23:02,473 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2023-11-30 06:23:02,473 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 289 transitions, 6771 flow [2023-11-30 06:23:02,474 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:23:02,474 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:02,474 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:23:02,486 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:23:02,679 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:23:02,679 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:23:02,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1856336227, now seen corresponding path program 1 times [2023-11-30 06:23:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127370046] [2023-11-30 06:23:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:02,757 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:23:02,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127370046] [2023-11-30 06:23:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127370046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320243799] [2023-11-30 06:23:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:02,781 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:23:02,800 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:23:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:02,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 06:23:02,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:02,886 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:23:02,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:02,960 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:23:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320243799] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:02,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-30 06:23:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149213845] [2023-11-30 06:23:02,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:02,961 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 06:23:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 06:23:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-30 06:23:02,962 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:23:02,963 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:23:02,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:02,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:23:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:03,478 INFO L124 PetriNetUnfolderBase]: 1260/3352 cut-off events. [2023-11-30 06:23:03,479 INFO L125 PetriNetUnfolderBase]: For 121991/130499 co-relation queries the response was YES. [2023-11-30 06:23:03,489 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:23:03,514 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 168 selfloop transitions, 103 changer transitions 0/342 dead transitions. [2023-11-30 06:23:03,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 342 transitions, 8865 flow [2023-11-30 06:23:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 06:23:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 06:23:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 930 transitions. [2023-11-30 06:23:03,516 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2023-11-30 06:23:03,516 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 930 transitions. [2023-11-30 06:23:03,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 930 transitions. [2023-11-30 06:23:03,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:03,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 930 transitions. [2023-11-30 06:23:03,518 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:23:03,520 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:23:03,520 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:23:03,520 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 57 predicate places. [2023-11-30 06:23:03,520 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 342 transitions, 8865 flow [2023-11-30 06:23:03,521 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:23:03,521 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:03,521 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:23:03,528 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:23:03,728 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:23:03,728 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:23:03,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1596023075, now seen corresponding path program 1 times [2023-11-30 06:23:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737279318] [2023-11-30 06:23:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:03,829 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:23:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737279318] [2023-11-30 06:23:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737279318] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053437090] [2023-11-30 06:23:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:03,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:03,831 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:23:03,852 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:23:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:03,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 06:23:03,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:03,954 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:23:03,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:04,047 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:23:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053437090] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:04,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:04,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-11-30 06:23:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24923013] [2023-11-30 06:23:04,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:04,048 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 06:23:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 06:23:04,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-30 06:23:04,050 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:23:04,051 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:23:04,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:04,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:23:04,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:05,125 INFO L124 PetriNetUnfolderBase]: 1836/5182 cut-off events. [2023-11-30 06:23:05,125 INFO L125 PetriNetUnfolderBase]: For 207169/218692 co-relation queries the response was YES. [2023-11-30 06:23:05,147 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:23:05,183 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 239 selfloop transitions, 151 changer transitions 1/462 dead transitions. [2023-11-30 06:23:05,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 462 transitions, 13407 flow [2023-11-30 06:23:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 06:23:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 06:23:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1141 transitions. [2023-11-30 06:23:05,186 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2023-11-30 06:23:05,186 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1141 transitions. [2023-11-30 06:23:05,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1141 transitions. [2023-11-30 06:23:05,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:05,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1141 transitions. [2023-11-30 06:23:05,188 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:23:05,190 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:23:05,190 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:23:05,190 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 72 predicate places. [2023-11-30 06:23:05,191 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 462 transitions, 13407 flow [2023-11-30 06:23:05,191 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:23:05,191 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:05,191 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:23:05,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 06:23:05,396 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:23:05,397 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:23:05,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495049, now seen corresponding path program 2 times [2023-11-30 06:23:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614406566] [2023-11-30 06:23:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:05,573 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:23:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614406566] [2023-11-30 06:23:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614406566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608292316] [2023-11-30 06:23:05,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:23:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:05,574 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:23:05,606 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:23:05,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:23:05,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:23:05,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-30 06:23:05,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:05,762 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:23:05,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:05,969 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:23:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608292316] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:05,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-11-30 06:23:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247762595] [2023-11-30 06:23:05,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:05,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 06:23:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 06:23:05,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-11-30 06:23:05,972 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:23:05,973 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:23:05,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:05,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:23:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:07,770 INFO L124 PetriNetUnfolderBase]: 3068/8044 cut-off events. [2023-11-30 06:23:07,770 INFO L125 PetriNetUnfolderBase]: For 438275/461720 co-relation queries the response was YES. [2023-11-30 06:23:07,801 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:23:07,944 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 392 selfloop transitions, 263 changer transitions 0/726 dead transitions. [2023-11-30 06:23:07,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 726 transitions, 23517 flow [2023-11-30 06:23:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-30 06:23:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-30 06:23:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2071 transitions. [2023-11-30 06:23:07,949 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8501642036124795 [2023-11-30 06:23:07,950 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2071 transitions. [2023-11-30 06:23:07,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2071 transitions. [2023-11-30 06:23:07,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:07,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2071 transitions. [2023-11-30 06:23:07,968 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:23:07,982 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:23:07,983 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:23:07,983 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 100 predicate places. [2023-11-30 06:23:07,983 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 726 transitions, 23517 flow [2023-11-30 06:23:07,984 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:23:07,984 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:07,984 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:23:07,992 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:23:08,189 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:23:08,190 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:23:08,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996361, now seen corresponding path program 2 times [2023-11-30 06:23:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240232531] [2023-11-30 06:23:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:08,660 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:23:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240232531] [2023-11-30 06:23:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240232531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019840800] [2023-11-30 06:23:08,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 06:23:08,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:08,662 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:23:08,708 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:23:08,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 06:23:08,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:23:08,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-30 06:23:08,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:08,921 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:23:08,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:09,515 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:23:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019840800] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:09,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2023-11-30 06:23:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966791194] [2023-11-30 06:23:09,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:09,516 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-30 06:23:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-30 06:23:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1656, Unknown=0, NotChecked=0, Total=2256 [2023-11-30 06:23:09,519 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2023-11-30 06:23:09,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 726 transitions, 23517 flow. Second operand has 48 states, 48 states have (on average 68.10416666666667) internal successors, (3269), 48 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:23:09,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:09,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2023-11-30 06:23:09,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:23:14,235 INFO L124 PetriNetUnfolderBase]: 5385/14447 cut-off events. [2023-11-30 06:23:14,235 INFO L125 PetriNetUnfolderBase]: For 879988/919266 co-relation queries the response was YES. [2023-11-30 06:23:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140187 conditions, 14447 events. 5385/14447 cut-off events. For 879988/919266 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 104994 event pairs, 417 based on Foata normal form. 22/12215 useless extension candidates. Maximal degree in co-relation 140104. Up to 8601 conditions per place. [2023-11-30 06:23:14,481 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 687 selfloop transitions, 470 changer transitions 2/1230 dead transitions. [2023-11-30 06:23:14,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1230 transitions, 43643 flow [2023-11-30 06:23:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 06:23:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 06:23:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3429 transitions. [2023-11-30 06:23:14,485 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8504464285714286 [2023-11-30 06:23:14,485 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3429 transitions. [2023-11-30 06:23:14,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3429 transitions. [2023-11-30 06:23:14,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:23:14,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3429 transitions. [2023-11-30 06:23:14,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 71.4375) internal successors, (3429), 48 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 06:23:14,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 84.0) internal successors, (4116), 49 states have internal predecessors, (4116), 0 states have call successors, (0), 0 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:23:14,493 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 84.0) internal successors, (4116), 49 states have internal predecessors, (4116), 0 states have call successors, (0), 0 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:23:14,494 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 147 predicate places. [2023-11-30 06:23:14,494 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 1230 transitions, 43643 flow [2023-11-30 06:23:14,495 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 68.10416666666667) internal successors, (3269), 48 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:23:14,495 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 06:23:14,495 INFO L232 CegarLoopForPetriNet]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 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:23:14,501 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:23:14,700 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:23:14,700 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-30 06:23:14,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 06:23:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -432540715, now seen corresponding path program 3 times [2023-11-30 06:23:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 06:23:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499028338] [2023-11-30 06:23:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 06:23:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 06:23:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 06:23:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 0 proven. 3173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 06:23:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 06:23:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499028338] [2023-11-30 06:23:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499028338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 06:23:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954316956] [2023-11-30 06:23:16,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 06:23:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:23:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 06:23:16,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 06:23:16,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 06:23:16,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2023-11-30 06:23:16,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 06:23:16,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 06:23:16,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 06:23:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 2869 proven. 275 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-30 06:23:17,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 06:23:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 2869 proven. 275 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-30 06:23:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954316956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 06:23:19,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 06:23:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 43, 43] total 88 [2023-11-30 06:23:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282486688] [2023-11-30 06:23:19,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 06:23:19,067 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-11-30 06:23:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 06:23:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-11-30 06:23:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6599, Unknown=0, NotChecked=0, Total=7656 [2023-11-30 06:23:19,075 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2023-11-30 06:23:19,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1230 transitions, 43643 flow. Second operand has 88 states, 88 states have (on average 60.0) internal successors, (5280), 88 states have internal predecessors, (5280), 0 states have call successors, (0), 0 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:23:19,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 06:23:19,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2023-11-30 06:23:19,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 06:25:29,828 INFO L124 PetriNetUnfolderBase]: 60140/188999 cut-off events. [2023-11-30 06:25:29,828 INFO L125 PetriNetUnfolderBase]: For 6443238/6558738 co-relation queries the response was YES. [2023-11-30 06:25:31,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564981 conditions, 188999 events. 60140/188999 cut-off events. For 6443238/6558738 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 2452027 event pairs, 1406 based on Foata normal form. 4740/176141 useless extension candidates. Maximal degree in co-relation 1564894. Up to 116749 conditions per place. [2023-11-30 06:25:32,332 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 0 selfloop transitions, 0 changer transitions 16099/16099 dead transitions. [2023-11-30 06:25:32,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1694 places, 16099 transitions, 485172 flow [2023-11-30 06:25:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1471 states. [2023-11-30 06:25:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2023-11-30 06:25:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 90533 transitions. [2023-11-30 06:25:32,411 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7326810397850506 [2023-11-30 06:25:32,412 INFO L72 ComplementDD]: Start complementDD. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:32,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:32,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 06:25:32,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 1471 states and 90533 transitions. [2023-11-30 06:25:32,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 1472 states, 1471 states have (on average 61.545207341944256) internal successors, (90533), 1471 states have internal predecessors, (90533), 0 states have call successors, (0), 0 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:25:32,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 1472 states, 1472 states have (on average 84.0) internal successors, (123648), 1472 states have internal predecessors, (123648), 0 states have call successors, (0), 0 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:25:32,869 INFO L81 ComplementDD]: Finished complementDD. Result has 1472 states, 1472 states have (on average 84.0) internal successors, (123648), 1472 states have internal predecessors, (123648), 0 states have call successors, (0), 0 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:25:32,871 INFO L307 CegarLoopForPetriNet]: 83 programPoint places, 1611 predicate places. [2023-11-30 06:25:32,871 INFO L500 AbstractCegarLoop]: Abstraction has has 1694 places, 16099 transitions, 485172 flow [2023-11-30 06:25:32,872 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 60.0) internal successors, (5280), 88 states have internal predecessors, (5280), 0 states have call successors, (0), 0 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:25:32,876 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longest-2.i_BEv2_AllErrorsAtOnce [2023-11-30 06:25:33,018 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-11-30 06:25:33,019 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-11-30 06:25:33,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-11-30 06:25:33,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-11-30 06:25:33,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-11-30 06:25:33,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-11-30 06:25:33,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-11-30 06:25:33,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-30 06:25:33,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 06:25:33,227 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 06:25:33,230 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 06:25:33,230 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 06:25:33,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 06:25:33 BasicIcfg [2023-11-30 06:25:33,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 06:25:33,236 INFO L158 Benchmark]: Toolchain (without parser) took 157821.88ms. Allocated memory was 364.9MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 326.7MB in the beginning and 10.5GB in the end (delta: -10.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-30 06:25:33,236 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 364.9MB. Free memory is still 321.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:25:33,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.43ms. Allocated memory is still 364.9MB. Free memory was 326.7MB in the beginning and 307.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 06:25:33,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.01ms. Allocated memory is still 364.9MB. Free memory was 307.0MB in the beginning and 305.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 06:25:33,237 INFO L158 Benchmark]: Boogie Preprocessor took 31.38ms. Allocated memory is still 364.9MB. Free memory was 305.0MB in the beginning and 303.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 06:25:33,237 INFO L158 Benchmark]: RCFGBuilder took 331.04ms. Allocated memory is still 364.9MB. Free memory was 303.7MB in the beginning and 288.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 06:25:33,239 INFO L158 Benchmark]: TraceAbstraction took 157040.92ms. Allocated memory was 364.9MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 287.8MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-11-30 06:25:33,240 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 364.9MB. Free memory is still 321.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 372.43ms. Allocated memory is still 364.9MB. Free memory was 326.7MB in the beginning and 307.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.01ms. Allocated memory is still 364.9MB. Free memory was 307.0MB in the beginning and 305.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.38ms. Allocated memory is still 364.9MB. Free memory was 305.0MB in the beginning and 303.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 331.04ms. Allocated memory is still 364.9MB. Free memory was 303.7MB in the beginning and 288.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 157040.92ms. Allocated memory was 364.9MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 287.8MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 4.1GB. 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: 157.0s, OverallIterations: 20, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 146.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9148 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9148 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 722 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11258 IncrementalHoareTripleChecker+Invalid, 11464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 97 mSDtfsCounter, 11258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3399 GetRequests, 1564 SyntacticMatches, 40 SemanticMatches, 1795 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238247 ImplicationChecksByTransitivity, 41.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485172occurred in iteration=20, InterpolantAutomatonStates: 1647, 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.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2039 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2794 ConstructedInterpolants, 0 QuantifiedInterpolants, 7510 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 5814/12521 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:25:33,257 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...