/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 04:49:37,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 04:49:38,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 04:49:38,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 04:49:38,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 04:49:38,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 04:49:38,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 04:49:38,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 04:49:38,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 04:49:38,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 04:49:38,101 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 04:49:38,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 04:49:38,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 04:49:38,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 04:49:38,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 04:49:38,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 04:49:38,104 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 04:49:38,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 04:49:38,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 04:49:38,105 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 04:49:38,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 04:49:38,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 04:49:38,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 04:49:38,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 04:49:38,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 04:49:38,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 04:49:38,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 04:49:38,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 04:49:38,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 04:49:38,107 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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-08-27 04:49:38,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 04:49:38,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 04:49:38,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 04:49:38,349 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 04:49:38,349 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 04:49:38,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2023-08-27 04:49:39,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 04:49:39,458 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 04:49:39,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2023-08-27 04:49:39,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d5c51f2/8f4355a4dfb44f69a74e75036f3e6810/FLAGc24eeeb99 [2023-08-27 04:49:39,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d5c51f2/8f4355a4dfb44f69a74e75036f3e6810 [2023-08-27 04:49:39,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 04:49:39,481 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 04:49:39,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 04:49:39,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 04:49:39,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 04:49:39,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249046bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39, skipping insertion in model container [2023-08-27 04:49:39,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 04:49:39,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 04:49:39,865 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 04:49:39,887 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [231] [2023-08-27 04:49:39,888 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-27 04:49:39,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 04:49:39,940 WARN L669 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 04:49:39,945 INFO L206 MainTranslator]: Completed translation [2023-08-27 04:49:39,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39 WrapperNode [2023-08-27 04:49:39,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 04:49:39,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 04:49:39,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 04:49:39,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 04:49:39,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,982 INFO L138 Inliner]: procedures = 271, calls = 46, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 113 [2023-08-27 04:49:39,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 04:49:39,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 04:49:39,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 04:49:39,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 04:49:39,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:39,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 04:49:40,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 04:49:40,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 04:49:40,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 04:49:40,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (1/1) ... [2023-08-27 04:49:40,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 04:49:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:49:40,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 04:49:40,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2023-08-27 04:49:40,094 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 04:49:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2023-08-27 04:49:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2023-08-27 04:49:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure process [2023-08-27 04:49:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2023-08-27 04:49:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 04:49:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 04:49:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 04:49:40,096 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 04:49:40,299 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 04:49:40,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 04:49:40,494 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 04:49:40,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 04:49:40,503 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-27 04:49:40,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:49:40 BoogieIcfgContainer [2023-08-27 04:49:40,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 04:49:40,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 04:49:40,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 04:49:40,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 04:49:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:49:39" (1/3) ... [2023-08-27 04:49:40,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475440b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:49:40, skipping insertion in model container [2023-08-27 04:49:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:49:39" (2/3) ... [2023-08-27 04:49:40,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475440b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:49:40, skipping insertion in model container [2023-08-27 04:49:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:49:40" (3/3) ... [2023-08-27 04:49:40,510 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2023-08-27 04:49:40,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 04:49:40,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-27 04:49:40,522 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 04:49:40,593 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 04:49:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 180 transitions, 375 flow [2023-08-27 04:49:40,689 INFO L124 PetriNetUnfolderBase]: 14/177 cut-off events. [2023-08-27 04:49:40,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:49:40,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 14/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 148. Up to 2 conditions per place. [2023-08-27 04:49:40,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 180 transitions, 375 flow [2023-08-27 04:49:40,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 177 transitions, 363 flow [2023-08-27 04:49:40,704 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 04:49:40,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 177 transitions, 363 flow [2023-08-27 04:49:40,715 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 177 transitions, 363 flow [2023-08-27 04:49:40,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 177 transitions, 363 flow [2023-08-27 04:49:40,761 INFO L124 PetriNetUnfolderBase]: 14/177 cut-off events. [2023-08-27 04:49:40,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:49:40,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 14/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 429 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 148. Up to 2 conditions per place. [2023-08-27 04:49:40,769 INFO L119 LiptonReduction]: Number of co-enabled transitions 13810 [2023-08-27 04:49:44,343 INFO L134 LiptonReduction]: Checked pairs total: 30912 [2023-08-27 04:49:44,344 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-27 04:49:44,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 04:49:44,355 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72c599b9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 04:49:44,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-27 04:49:44,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 04:49:44,358 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-27 04:49:44,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:49:44,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:49:44,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:49:44,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting generateErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:49:44,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:49:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1118695246, now seen corresponding path program 1 times [2023-08-27 04:49:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:49:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136612835] [2023-08-27 04:49:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:49:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:49:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:49:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:49:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:49:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136612835] [2023-08-27 04:49:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136612835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:49:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:49:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:49:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720418367] [2023-08-27 04:49:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:49:44,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:49:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:49:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:49:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:49:44,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 346 [2023-08-27 04:49:44,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:44,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:49:44,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 346 [2023-08-27 04:49:44,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:49:47,255 INFO L124 PetriNetUnfolderBase]: 40196/54854 cut-off events. [2023-08-27 04:49:47,256 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-08-27 04:49:47,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108016 conditions, 54854 events. 40196/54854 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 335590 event pairs, 22272 based on Foata normal form. 1020/38239 useless extension candidates. Maximal degree in co-relation 108005. Up to 36957 conditions per place. [2023-08-27 04:49:47,542 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 90 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-08-27 04:49:47,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 393 flow [2023-08-27 04:49:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:49:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:49:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-08-27 04:49:47,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558766859344894 [2023-08-27 04:49:47,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-08-27 04:49:47,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-08-27 04:49:47,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:49:47,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-08-27 04:49:47,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:47,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:47,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:47,570 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 127 flow. Second operand 3 states and 577 transitions. [2023-08-27 04:49:47,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 393 flow [2023-08-27 04:49:47,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 04:49:47,577 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 130 flow [2023-08-27 04:49:47,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-27 04:49:47,580 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-08-27 04:49:47,580 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 130 flow [2023-08-27 04:49:47,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:47,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:49:47,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:49:47,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 04:49:47,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:49:47,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:49:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 894742974, now seen corresponding path program 1 times [2023-08-27 04:49:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:49:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933910490] [2023-08-27 04:49:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:49:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:49:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:49:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:49:47,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:49:47,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933910490] [2023-08-27 04:49:47,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933910490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:49:47,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:49:47,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 04:49:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748754183] [2023-08-27 04:49:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:49:47,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:49:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:49:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:49:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:49:47,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 346 [2023-08-27 04:49:47,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:47,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:49:47,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 346 [2023-08-27 04:49:47,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:49:52,032 INFO L124 PetriNetUnfolderBase]: 79441/105729 cut-off events. [2023-08-27 04:49:52,032 INFO L125 PetriNetUnfolderBase]: For 11399/11399 co-relation queries the response was YES. [2023-08-27 04:49:52,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226087 conditions, 105729 events. 79441/105729 cut-off events. For 11399/11399 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 628185 event pairs, 27565 based on Foata normal form. 0/73655 useless extension candidates. Maximal degree in co-relation 226077. Up to 53154 conditions per place. [2023-08-27 04:49:52,587 INFO L140 encePairwiseOnDemand]: 334/346 looper letters, 90 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2023-08-27 04:49:52,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 102 transitions, 440 flow [2023-08-27 04:49:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:49:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:49:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-08-27 04:49:52,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414258188824663 [2023-08-27 04:49:52,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-08-27 04:49:52,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-08-27 04:49:52,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:49:52,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-08-27 04:49:52,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:52,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:52,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:52,593 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 130 flow. Second operand 3 states and 562 transitions. [2023-08-27 04:49:52,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 102 transitions, 440 flow [2023-08-27 04:49:52,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:49:52,607 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 202 flow [2023-08-27 04:49:52,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-27 04:49:52,607 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-08-27 04:49:52,608 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 202 flow [2023-08-27 04:49:52,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:52,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:49:52,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:49:52,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 04:49:52,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:49:52,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:49:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 894742939, now seen corresponding path program 1 times [2023-08-27 04:49:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:49:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927770059] [2023-08-27 04:49:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:49:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:49:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:49:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:49:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:49:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927770059] [2023-08-27 04:49:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927770059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:49:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:49:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 04:49:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485230963] [2023-08-27 04:49:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:49:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:49:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:49:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:49:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:49:52,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 346 [2023-08-27 04:49:52,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:52,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:49:52,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 346 [2023-08-27 04:49:52,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:49:58,309 INFO L124 PetriNetUnfolderBase]: 92885/124310 cut-off events. [2023-08-27 04:49:58,309 INFO L125 PetriNetUnfolderBase]: For 31230/31230 co-relation queries the response was YES. [2023-08-27 04:49:58,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296977 conditions, 124310 events. 92885/124310 cut-off events. For 31230/31230 co-relation queries the response was YES. Maximal size of possible extension queue 2549. Compared 764078 event pairs, 26879 based on Foata normal form. 2516/98834 useless extension candidates. Maximal degree in co-relation 296964. Up to 72259 conditions per place. [2023-08-27 04:49:58,881 INFO L140 encePairwiseOnDemand]: 334/346 looper letters, 91 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2023-08-27 04:49:58,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 512 flow [2023-08-27 04:49:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:49:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:49:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-08-27 04:49:58,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5385356454720617 [2023-08-27 04:49:58,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-08-27 04:49:58,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-08-27 04:49:58,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:49:58,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-08-27 04:49:58,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:58,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:58,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:58,886 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 202 flow. Second operand 3 states and 559 transitions. [2023-08-27 04:49:58,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 512 flow [2023-08-27 04:49:58,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 04:49:58,919 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 244 flow [2023-08-27 04:49:58,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-27 04:49:58,920 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-08-27 04:49:58,920 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 244 flow [2023-08-27 04:49:58,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:58,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:49:58,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:49:58,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 04:49:58,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:49:58,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:49:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -789255750, now seen corresponding path program 1 times [2023-08-27 04:49:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:49:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902174387] [2023-08-27 04:49:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:49:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:49:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:49:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:49:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:49:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902174387] [2023-08-27 04:49:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902174387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:49:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:49:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 04:49:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585103569] [2023-08-27 04:49:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:49:59,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:49:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:49:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:49:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:49:59,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 346 [2023-08-27 04:49:59,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:59,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:49:59,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 346 [2023-08-27 04:49:59,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:05,844 INFO L124 PetriNetUnfolderBase]: 113659/150843 cut-off events. [2023-08-27 04:50:05,845 INFO L125 PetriNetUnfolderBase]: For 60581/60581 co-relation queries the response was YES. [2023-08-27 04:50:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378382 conditions, 150843 events. 113659/150843 cut-off events. For 60581/60581 co-relation queries the response was YES. Maximal size of possible extension queue 2752. Compared 911177 event pairs, 23542 based on Foata normal form. 0/118824 useless extension candidates. Maximal degree in co-relation 378367. Up to 134279 conditions per place. [2023-08-27 04:50:06,538 INFO L140 encePairwiseOnDemand]: 336/346 looper letters, 92 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2023-08-27 04:50:06,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 594 flow [2023-08-27 04:50:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:50:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:50:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-27 04:50:06,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144508670520231 [2023-08-27 04:50:06,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-27 04:50:06,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-27 04:50:06,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:06,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-27 04:50:06,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:06,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:06,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:06,544 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 244 flow. Second operand 3 states and 534 transitions. [2023-08-27 04:50:06,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 594 flow [2023-08-27 04:50:06,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 04:50:06,574 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 335 flow [2023-08-27 04:50:06,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2023-08-27 04:50:06,574 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2023-08-27 04:50:06,574 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 335 flow [2023-08-27 04:50:06,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:06,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:06,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:50:06,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 04:50:06,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:06,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 60676445, now seen corresponding path program 1 times [2023-08-27 04:50:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:06,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914948447] [2023-08-27 04:50:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914948447] [2023-08-27 04:50:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914948447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:50:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 04:50:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529624127] [2023-08-27 04:50:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 04:50:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 04:50:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 04:50:06,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 346 [2023-08-27 04:50:06,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:06,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:06,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 346 [2023-08-27 04:50:06,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:13,012 INFO L124 PetriNetUnfolderBase]: 97199/130115 cut-off events. [2023-08-27 04:50:13,012 INFO L125 PetriNetUnfolderBase]: For 67757/67757 co-relation queries the response was YES. [2023-08-27 04:50:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338653 conditions, 130115 events. 97199/130115 cut-off events. For 67757/67757 co-relation queries the response was YES. Maximal size of possible extension queue 2944. Compared 814102 event pairs, 44654 based on Foata normal form. 518/104290 useless extension candidates. Maximal degree in co-relation 338637. Up to 89752 conditions per place. [2023-08-27 04:50:13,923 INFO L140 encePairwiseOnDemand]: 333/346 looper letters, 154 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2023-08-27 04:50:13,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1046 flow [2023-08-27 04:50:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 04:50:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 04:50:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 730 transitions. [2023-08-27 04:50:13,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274566473988439 [2023-08-27 04:50:13,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 730 transitions. [2023-08-27 04:50:13,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 730 transitions. [2023-08-27 04:50:13,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:13,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 730 transitions. [2023-08-27 04:50:13,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:13,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:13,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:13,929 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 335 flow. Second operand 4 states and 730 transitions. [2023-08-27 04:50:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1046 flow [2023-08-27 04:50:13,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 171 transitions, 1020 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:50:13,982 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 488 flow [2023-08-27 04:50:13,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=488, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2023-08-27 04:50:13,983 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-27 04:50:13,983 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 488 flow [2023-08-27 04:50:13,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:13,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:13,984 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-08-27 04:50:13,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 04:50:13,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting generateErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:13,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1397970840, now seen corresponding path program 1 times [2023-08-27 04:50:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968769699] [2023-08-27 04:50:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 04:50:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968769699] [2023-08-27 04:50:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968769699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:50:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:50:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803076387] [2023-08-27 04:50:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:14,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:50:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:50:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:50:14,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 346 [2023-08-27 04:50:14,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:14,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:14,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 346 [2023-08-27 04:50:14,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:19,515 INFO L124 PetriNetUnfolderBase]: 76019/104245 cut-off events. [2023-08-27 04:50:19,515 INFO L125 PetriNetUnfolderBase]: For 99215/101771 co-relation queries the response was YES. [2023-08-27 04:50:19,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293977 conditions, 104245 events. 76019/104245 cut-off events. For 99215/101771 co-relation queries the response was YES. Maximal size of possible extension queue 2670. Compared 679689 event pairs, 18382 based on Foata normal form. 334/85511 useless extension candidates. Maximal degree in co-relation 293959. Up to 66700 conditions per place. [2023-08-27 04:50:20,059 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 114 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2023-08-27 04:50:20,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 898 flow [2023-08-27 04:50:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:50:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:50:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-08-27 04:50:20,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433526011560693 [2023-08-27 04:50:20,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-08-27 04:50:20,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-08-27 04:50:20,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:20,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-08-27 04:50:20,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,065 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 488 flow. Second operand 3 states and 564 transitions. [2023-08-27 04:50:20,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 898 flow [2023-08-27 04:50:20,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 890 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 04:50:20,114 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 492 flow [2023-08-27 04:50:20,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2023-08-27 04:50:20,115 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2023-08-27 04:50:20,115 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 492 flow [2023-08-27 04:50:20,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:20,115 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-08-27 04:50:20,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 04:50:20,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting generateErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:20,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1397970841, now seen corresponding path program 1 times [2023-08-27 04:50:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328017544] [2023-08-27 04:50:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328017544] [2023-08-27 04:50:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328017544] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:50:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154418187] [2023-08-27 04:50:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:50:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:50:20,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 04:50:20,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-27 04:50:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:20,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 04:50:20,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:50:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:20,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 04:50:20,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154418187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:20,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 04:50:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 04:50:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656080425] [2023-08-27 04:50:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 04:50:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 04:50:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 04:50:20,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 346 [2023-08-27 04:50:20,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:20,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 346 [2023-08-27 04:50:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:25,168 INFO L124 PetriNetUnfolderBase]: 67449/92047 cut-off events. [2023-08-27 04:50:25,169 INFO L125 PetriNetUnfolderBase]: For 126152/128584 co-relation queries the response was YES. [2023-08-27 04:50:25,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275627 conditions, 92047 events. 67449/92047 cut-off events. For 126152/128584 co-relation queries the response was YES. Maximal size of possible extension queue 2374. Compared 594093 event pairs, 4707 based on Foata normal form. 3158/81032 useless extension candidates. Maximal degree in co-relation 275609. Up to 51890 conditions per place. [2023-08-27 04:50:25,670 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 158 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-08-27 04:50:25,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 173 transitions, 1138 flow [2023-08-27 04:50:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 04:50:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 04:50:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2023-08-27 04:50:25,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513005780346821 [2023-08-27 04:50:25,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2023-08-27 04:50:25,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2023-08-27 04:50:25,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:25,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2023-08-27 04:50:25,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:25,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:25,676 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:25,676 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 492 flow. Second operand 4 states and 763 transitions. [2023-08-27 04:50:25,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 173 transitions, 1138 flow [2023-08-27 04:50:25,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 173 transitions, 1134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:50:25,740 INFO L231 Difference]: Finished difference. Result has 69 places, 84 transitions, 488 flow [2023-08-27 04:50:25,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=488, PETRI_PLACES=69, PETRI_TRANSITIONS=84} [2023-08-27 04:50:25,741 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2023-08-27 04:50:25,741 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 84 transitions, 488 flow [2023-08-27 04:50:25,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:25,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:25,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:50:25,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 04:50:25,946 WARN L477 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-08-27 04:50:25,947 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting disposeErr0ASSERT_VIOLATIONASSERT === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:25,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1285035168, now seen corresponding path program 1 times [2023-08-27 04:50:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620772946] [2023-08-27 04:50:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:26,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:26,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620772946] [2023-08-27 04:50:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620772946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:26,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:50:26,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:50:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691608011] [2023-08-27 04:50:26,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:26,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 04:50:26,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 04:50:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 04:50:26,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 346 [2023-08-27 04:50:26,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 84 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:26,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:26,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 346 [2023-08-27 04:50:26,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:36,482 INFO L124 PetriNetUnfolderBase]: 142984/196840 cut-off events. [2023-08-27 04:50:36,482 INFO L125 PetriNetUnfolderBase]: For 234034/249788 co-relation queries the response was YES. [2023-08-27 04:50:37,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568063 conditions, 196840 events. 142984/196840 cut-off events. For 234034/249788 co-relation queries the response was YES. Maximal size of possible extension queue 4006. Compared 1328674 event pairs, 19737 based on Foata normal form. 2312/172755 useless extension candidates. Maximal degree in co-relation 568044. Up to 93741 conditions per place. [2023-08-27 04:50:37,685 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 178 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2023-08-27 04:50:37,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 213 transitions, 1408 flow [2023-08-27 04:50:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 04:50:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 04:50:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 931 transitions. [2023-08-27 04:50:37,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381502890173411 [2023-08-27 04:50:37,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 931 transitions. [2023-08-27 04:50:37,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 931 transitions. [2023-08-27 04:50:37,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:37,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 931 transitions. [2023-08-27 04:50:37,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.2) internal successors, (931), 5 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:37,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:37,691 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:37,691 INFO L175 Difference]: Start difference. First operand has 69 places, 84 transitions, 488 flow. Second operand 5 states and 931 transitions. [2023-08-27 04:50:37,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 213 transitions, 1408 flow [2023-08-27 04:50:40,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 213 transitions, 1396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 04:50:40,711 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 601 flow [2023-08-27 04:50:40,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2023-08-27 04:50:40,711 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2023-08-27 04:50:40,711 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 601 flow [2023-08-27 04:50:40,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:40,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:40,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:50:40,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 04:50:40,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:40,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash 716134621, now seen corresponding path program 1 times [2023-08-27 04:50:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:40,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836237473] [2023-08-27 04:50:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836237473] [2023-08-27 04:50:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836237473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:50:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 04:50:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315181324] [2023-08-27 04:50:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:40,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 04:50:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 04:50:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 04:50:40,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 346 [2023-08-27 04:50:40,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:40,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:40,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 346 [2023-08-27 04:50:40,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:55,801 INFO L124 PetriNetUnfolderBase]: 193470/259375 cut-off events. [2023-08-27 04:50:55,801 INFO L125 PetriNetUnfolderBase]: For 457937/466361 co-relation queries the response was YES. [2023-08-27 04:50:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847471 conditions, 259375 events. 193470/259375 cut-off events. For 457937/466361 co-relation queries the response was YES. Maximal size of possible extension queue 5000. Compared 1729844 event pairs, 33200 based on Foata normal form. 4858/243341 useless extension candidates. Maximal degree in co-relation 847447. Up to 125033 conditions per place. [2023-08-27 04:50:57,583 INFO L140 encePairwiseOnDemand]: 334/346 looper letters, 218 selfloop transitions, 48 changer transitions 0/272 dead transitions. [2023-08-27 04:50:57,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 272 transitions, 1909 flow [2023-08-27 04:50:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 04:50:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 04:50:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1246 transitions. [2023-08-27 04:50:57,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144508670520231 [2023-08-27 04:50:57,586 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1246 transitions. [2023-08-27 04:50:57,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1246 transitions. [2023-08-27 04:50:57,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:57,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1246 transitions. [2023-08-27 04:50:57,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:57,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:57,591 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:57,591 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 601 flow. Second operand 7 states and 1246 transitions. [2023-08-27 04:50:57,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 272 transitions, 1909 flow [2023-08-27 04:50:59,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 272 transitions, 1909 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 04:50:59,626 INFO L231 Difference]: Finished difference. Result has 85 places, 122 transitions, 1061 flow [2023-08-27 04:50:59,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1061, PETRI_PLACES=85, PETRI_TRANSITIONS=122} [2023-08-27 04:50:59,626 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 24 predicate places. [2023-08-27 04:50:59,627 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 122 transitions, 1061 flow [2023-08-27 04:50:59,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:59,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:59,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:50:59,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 04:50:59,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting processErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:50:59,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 716134635, now seen corresponding path program 1 times [2023-08-27 04:50:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093467458] [2023-08-27 04:50:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:50:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:59,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093467458] [2023-08-27 04:50:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093467458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:50:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:50:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 04:50:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492626168] [2023-08-27 04:50:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:50:59,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 04:50:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 04:50:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 04:50:59,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 346 [2023-08-27 04:50:59,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 122 transitions, 1061 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:59,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:59,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 346 [2023-08-27 04:50:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:51:20,820 INFO L124 PetriNetUnfolderBase]: 225932/303463 cut-off events. [2023-08-27 04:51:20,821 INFO L125 PetriNetUnfolderBase]: For 851970/862058 co-relation queries the response was YES. [2023-08-27 04:51:22,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082235 conditions, 303463 events. 225932/303463 cut-off events. For 851970/862058 co-relation queries the response was YES. Maximal size of possible extension queue 5782. Compared 2064395 event pairs, 48369 based on Foata normal form. 8336/287296 useless extension candidates. Maximal degree in co-relation 1082205. Up to 105508 conditions per place. [2023-08-27 04:51:23,223 INFO L140 encePairwiseOnDemand]: 333/346 looper letters, 216 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2023-08-27 04:51:23,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 298 transitions, 2446 flow [2023-08-27 04:51:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 04:51:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 04:51:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1250 transitions. [2023-08-27 04:51:23,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161023947151114 [2023-08-27 04:51:23,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1250 transitions. [2023-08-27 04:51:23,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1250 transitions. [2023-08-27 04:51:23,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:51:23,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1250 transitions. [2023-08-27 04:51:23,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.57142857142858) internal successors, (1250), 7 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:23,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:23,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:23,232 INFO L175 Difference]: Start difference. First operand has 85 places, 122 transitions, 1061 flow. Second operand 7 states and 1250 transitions. [2023-08-27 04:51:23,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 298 transitions, 2446 flow [2023-08-27 04:51:31,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 298 transitions, 2375 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-27 04:51:31,833 INFO L231 Difference]: Finished difference. Result has 94 places, 147 transitions, 1536 flow [2023-08-27 04:51:31,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1536, PETRI_PLACES=94, PETRI_TRANSITIONS=147} [2023-08-27 04:51:31,833 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2023-08-27 04:51:31,833 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 147 transitions, 1536 flow [2023-08-27 04:51:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:31,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:51:31,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:51:31,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 04:51:31,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 04:51:31,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:51:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1234720796, now seen corresponding path program 1 times [2023-08-27 04:51:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:51:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707060950] [2023-08-27 04:51:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:51:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:51:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:51:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:51:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:51:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707060950] [2023-08-27 04:51:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707060950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:51:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:51:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 04:51:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14018050] [2023-08-27 04:51:31,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:51:31,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:51:31,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:51:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:51:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:51:31,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 346 [2023-08-27 04:51:31,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 147 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:31,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:51:31,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 346 [2023-08-27 04:51:31,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:51:38,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 262#true, 276#true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), 49#L1211-1true, Black: 210#true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:38,672 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-27 04:51:38,672 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:38,672 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-27 04:51:38,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:40,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [278#(<= ~A~0 5), Black: 190#true, Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 266#(<= 6 ~A~0), Black: 210#true, 49#L1211-1true, 264#(<= 5 ~A~0), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 16#L1161true, 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, 203#(= generateThread1of1ForFork1_~i~0 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), Black: 184#true]) [2023-08-27 04:51:40,105 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,105 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:40,105 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,105 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:40,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [30#L1205-8true, Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 262#true, 276#true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), Black: 210#true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:40,598 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,598 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-27 04:51:40,598 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,598 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 262#true, 276#true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), Black: 210#true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 115#ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 198#(= ~B~0 ~A~0), 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:40,599 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 262#true, 276#true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), Black: 210#true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 52#ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:40,599 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,599 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:40,600 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-27 04:51:40,600 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-27 04:51:42,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [278#(<= ~A~0 5), 30#L1205-8true, Black: 190#true, Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 266#(<= 6 ~A~0), Black: 210#true, 264#(<= 5 ~A~0), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 16#L1161true, 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, 203#(= generateThread1of1ForFork1_~i~0 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), Black: 184#true]) [2023-08-27 04:51:42,253 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [278#(<= ~A~0 5), Black: 190#true, Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 266#(<= 6 ~A~0), Black: 210#true, 264#(<= 5 ~A~0), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 16#L1161true, 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, 203#(= generateThread1of1ForFork1_~i~0 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 115#ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 198#(= ~B~0 ~A~0), Black: 184#true]) [2023-08-27 04:51:42,254 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,254 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-27 04:51:42,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [278#(<= ~A~0 5), Black: 190#true, Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), Black: 266#(<= 6 ~A~0), Black: 210#true, 264#(<= 5 ~A~0), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 16#L1161true, 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, 52#ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 203#(= generateThread1of1ForFork1_~i~0 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 198#(= ~B~0 ~A~0), Black: 184#true]) [2023-08-27 04:51:42,255 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,255 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,255 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-27 04:51:42,255 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-27 04:51:42,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][82], [Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), 2#L1190true, Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 262#true, 276#true, 290#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), Black: 210#true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 3#ULTIMATE.startEXITtrue, 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), 198#(= ~B~0 ~A~0), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:42,791 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,791 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,791 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,791 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L1171-1-->L1173-3: Formula: (and (= v_~A~0_46 v_~B~0_33) (<= 0 (+ 2147483647 |v_processThread1of1ForFork2_#t~post7_31|)) (= |v_processThread1of1ForFork2_#t~post7_31| v_~B~0_33) (<= |v_processThread1of1ForFork2_#t~post7_31| 2147483648)) InVars {~A~0=v_~A~0_46} OutVars{~A~0=v_~A~0_46, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_13|, ~B~0=v_~B~0_33, processThread1of1ForFork2_#t~post7=|v_processThread1of1ForFork2_#t~post7_31|} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0, processThread1of1ForFork2_#t~post7][69], [Black: 253#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 251#true, Black: 192#(<= 5 ~A~0), Black: 256#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, 262#true, 292#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 276#true, 153#L1173-3true, Black: 265#(<= 5 |processThread1of1ForFork2_#t~post5|), Black: 203#(= generateThread1of1ForFork1_~i~0 1), Black: 266#(<= 6 ~A~0), Black: 264#(<= 5 ~A~0), Black: 210#true, 98#L1206-1true, Black: 278#(<= ~A~0 5), Black: 282#(and (<= |processThread1of1ForFork2_#t~post5| 5) (<= ~A~0 5)), Black: 280#(<= ~A~0 6), Black: 279#(<= |processThread1of1ForFork2_#t~post5| 5), 254#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 146#L1160true, disposeThread1of1ForFork0InUse, 206#(and (= ~A~0 1) (= generateThread1of1ForFork1_~i~0 1)), 198#(= ~B~0 ~A~0), Black: 186#(<= ~A~0 5)]) [2023-08-27 04:51:42,798 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-27 04:51:42,798 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,798 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-27 04:51:42,798 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event