/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 -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/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:15:42,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:15:42,884 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-26 21:15:42,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:15:42,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:15:42,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:15:42,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:15:42,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:15:42,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:15:42,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:15:42,925 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:15:42,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:15:42,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:15:42,926 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:15:42,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:15:42,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:15:42,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:15:42,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:15:42,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:15:42,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:15:42,928 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:15:42,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:15:42,929 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:15:42,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:15:42,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:15:42,930 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:15:42,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:15:42,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:15:42,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:15:42,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:15:42,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:15:42,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:15:42,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:15:42,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:15:42,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:15:42,932 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.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-26 21:15:43,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:15:43,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:15:43,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:15:43,236 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:15:43,237 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:15:43,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-26 21:15:44,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:15:44,623 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:15:44,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-26 21:15:44,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1ded1a5/7ec2b72f91be4f678c055e7ccbf7a8aa/FLAGd8ab0b353 [2023-08-26 21:15:44,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1ded1a5/7ec2b72f91be4f678c055e7ccbf7a8aa [2023-08-26 21:15:44,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:15:44,653 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:15:44,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:15:44,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:15:44,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:15:44,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:44" (1/1) ... [2023-08-26 21:15:44,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30566bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:44, skipping insertion in model container [2023-08-26 21:15:44,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:44" (1/1) ... [2023-08-26 21:15:44,701 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:15:45,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:15:45,029 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:15:45,057 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:15:45,059 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:15:45,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:15:45,138 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:15:45,138 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:15:45,145 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:15:45,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45 WrapperNode [2023-08-26 21:15:45,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:15:45,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:15:45,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:15:45,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:15:45,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,205 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-08-26 21:15:45,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:15:45,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:15:45,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:15:45,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:15:45,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:15:45,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:15:45,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:15:45,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:15:45,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (1/1) ... [2023-08-26 21:15:45,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:15:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:15:45,275 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-26 21:15:45,298 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-26 21:15:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:15:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:15:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:15:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:15:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:15:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:15:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:15:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:15:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:15:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:15:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:15:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:15:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:15:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:15:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:15:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:15:45,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:15:45,320 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:15:45,438 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:15:45,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:15:45,719 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:15:45,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:15:45,867 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:15:45,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:45 BoogieIcfgContainer [2023-08-26 21:15:45,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:15:45,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:15:45,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:15:45,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:15:45,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:15:44" (1/3) ... [2023-08-26 21:15:45,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4580bc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:45, skipping insertion in model container [2023-08-26 21:15:45,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:45" (2/3) ... [2023-08-26 21:15:45,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4580bc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:45, skipping insertion in model container [2023-08-26 21:15:45,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:45" (3/3) ... [2023-08-26 21:15:45,876 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-08-26 21:15:45,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:15:45,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:15:45,891 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:15:45,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:15:45,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:15:46,051 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:15:46,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:46,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-26 21:15:46,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 21:15:46,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 21:15:46,067 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:15:46,086 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:15:46,088 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 21:15:46,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 21:15:46,138 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 21:15:46,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:46,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-26 21:15:46,143 INFO L119 LiptonReduction]: Number of co-enabled transitions 4526 [2023-08-26 21:15:50,882 INFO L134 LiptonReduction]: Checked pairs total: 17801 [2023-08-26 21:15:50,882 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 21:15:50,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:15:50,900 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;@5d248135, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:15:50,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:15:50,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:15:50,904 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-26 21:15:50,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:50,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:50,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:15:50,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:15:50,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 602255970, now seen corresponding path program 1 times [2023-08-26 21:15:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064246096] [2023-08-26 21:15:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:51,324 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-26 21:15:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064246096] [2023-08-26 21:15:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064246096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004201901] [2023-08-26 21:15:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:51,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:51,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 264 [2023-08-26 21:15:51,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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-26 21:15:51,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:51,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 264 [2023-08-26 21:15:51,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:53,317 INFO L124 PetriNetUnfolderBase]: 10064/14982 cut-off events. [2023-08-26 21:15:53,317 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-26 21:15:53,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28800 conditions, 14982 events. 10064/14982 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 100176 event pairs, 1472 based on Foata normal form. 0/11569 useless extension candidates. Maximal degree in co-relation 28788. Up to 11333 conditions per place. [2023-08-26 21:15:53,463 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 46 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-26 21:15:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 228 flow [2023-08-26 21:15:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:15:53,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2023-08-26 21:15:53,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:15:53,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:15:53,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:53,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:15:53,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-26 21:15:53,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:15:53,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:15:53,503 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:15:53,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 228 flow [2023-08-26 21:15:53,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:15:53,511 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-26 21:15:53,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 21:15:53,520 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-26 21:15:53,521 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-26 21:15:53,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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-26 21:15:53,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:53,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:15:53,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:15:53,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:15:53,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1488355130, now seen corresponding path program 1 times [2023-08-26 21:15:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:53,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660213118] [2023-08-26 21:15:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:53,605 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-26 21:15:53,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:53,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660213118] [2023-08-26 21:15:53,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660213118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:53,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:53,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:53,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892650494] [2023-08-26 21:15:53,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:53,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:53,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:53,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 264 [2023-08-26 21:15:53,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-26 21:15:53,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:53,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 264 [2023-08-26 21:15:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:55,323 INFO L124 PetriNetUnfolderBase]: 10523/14692 cut-off events. [2023-08-26 21:15:55,323 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-08-26 21:15:55,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30188 conditions, 14692 events. 10523/14692 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 83404 event pairs, 2964 based on Foata normal form. 0/9933 useless extension candidates. Maximal degree in co-relation 30178. Up to 12949 conditions per place. [2023-08-26 21:15:55,477 INFO L140 encePairwiseOnDemand]: 251/264 looper letters, 49 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-26 21:15:55,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 246 flow [2023-08-26 21:15:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 21:15:55,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2023-08-26 21:15:55,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 21:15:55,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 21:15:55,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:55,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 21:15:55,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-26 21:15:55,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:15:55,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:15:55,488 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 398 transitions. [2023-08-26 21:15:55,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 246 flow [2023-08-26 21:15:55,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:55,491 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 129 flow [2023-08-26 21:15:55,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 21:15:55,493 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-26 21:15:55,496 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 129 flow [2023-08-26 21:15:55,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-26 21:15:55,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:55,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:55,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:15:55,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:15:55,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -416605414, now seen corresponding path program 1 times [2023-08-26 21:15:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862811578] [2023-08-26 21:15:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:56,000 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-26 21:15:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862811578] [2023-08-26 21:15:56,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862811578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:56,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:15:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997997144] [2023-08-26 21:15:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:56,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:56,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:56,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:56,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 264 [2023-08-26 21:15:56,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-26 21:15:56,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:56,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 264 [2023-08-26 21:15:56,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:58,593 INFO L124 PetriNetUnfolderBase]: 21128/29797 cut-off events. [2023-08-26 21:15:58,593 INFO L125 PetriNetUnfolderBase]: For 3532/4464 co-relation queries the response was YES. [2023-08-26 21:15:58,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70665 conditions, 29797 events. 21128/29797 cut-off events. For 3532/4464 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 176979 event pairs, 5586 based on Foata normal form. 0/24939 useless extension candidates. Maximal degree in co-relation 70654. Up to 18078 conditions per place. [2023-08-26 21:15:58,807 INFO L140 encePairwiseOnDemand]: 251/264 looper letters, 72 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2023-08-26 21:15:58,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 440 flow [2023-08-26 21:15:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-26 21:15:58,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45359848484848486 [2023-08-26 21:15:58,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-26 21:15:58,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-26 21:15:58,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:58,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-26 21:15:58,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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-26 21:15:58,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:15:58,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:15:58,814 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 129 flow. Second operand 4 states and 479 transitions. [2023-08-26 21:15:58,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 440 flow [2023-08-26 21:15:58,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:58,821 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 216 flow [2023-08-26 21:15:58,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-08-26 21:15:58,823 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-26 21:15:58,823 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 216 flow [2023-08-26 21:15:58,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-26 21:15:58,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:58,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:58,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:15:58,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:15:58,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1078074901, now seen corresponding path program 1 times [2023-08-26 21:15:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:58,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314540207] [2023-08-26 21:15:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:58,903 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-26 21:15:58,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314540207] [2023-08-26 21:15:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314540207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:15:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056436319] [2023-08-26 21:15:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:58,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 264 [2023-08-26 21:15:58,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-26 21:15:58,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:58,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 264 [2023-08-26 21:15:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:59,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([462] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][37], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 3#ULTIMATE.startEXITtrue, Black: 164#true, 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 119#L811true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 21#$Ultimate##0true]) [2023-08-26 21:15:59,774 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:15:59,774 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:15:59,774 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:15:59,774 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:16:00,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([462] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][37], [75#L821true, 42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 3#ULTIMATE.startEXITtrue, Black: 164#true, 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 119#L811true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse]) [2023-08-26 21:16:00,081 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,081 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,081 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,082 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L869-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd0~0_92 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~x$w_buff0_used~0_202 256) 0)) (.cse2 (and .cse8 (= (mod v_~x$w_buff1_used~0_171 256) 0))) (.cse4 (and .cse8 .cse10))) (let ((.cse5 (or .cse12 .cse2 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_170 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_201 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_46 256) 0))) (.cse0 (ite .cse5 v_~x~0_124 (ite .cse6 v_~x$w_buff0~0_97 v_~x$w_buff1~0_82)))) (and (= v_~x$mem_tmp~0_30 v_~x~0_124) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~x$flush_delayed~0_39 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_24 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= 2 .cse0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$w_buff1_used~0_170 (ite .cse1 v_~x$w_buff1_used~0_171 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_171 0))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= (ite .cse1 v_~x$w_buff0_used~0_202 (ite .cse5 v_~x$w_buff0_used~0_202 (ite .cse6 0 v_~x$w_buff0_used~0_202))) v_~x$w_buff0_used~0_201) (= v_~x$w_buff0~0_97 v_~x$w_buff0~0_96) (= (ite .cse1 v_~x$r_buff0_thd0~0_96 (ite (or (and .cse7 .cse8) .cse3 .cse4) v_~x$r_buff0_thd0~0_96 (ite (and (not .cse3) .cse9) 0 v_~x$r_buff0_thd0~0_96))) v_~x$r_buff0_thd0~0_95) (= v_~x$w_buff1~0_82 v_~x$w_buff1~0_81) (= v_~x$r_buff1_thd0~0_91 (ite .cse1 v_~x$r_buff1_thd0~0_92 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_95 256) 0))) (or (and .cse10 .cse11) (and .cse7 .cse11) .cse3)) v_~x$r_buff1_thd0~0_92 0))) (= (ite .cse1 v_~x$mem_tmp~0_30 .cse0) v_~x~0_123)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_97, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x$w_buff1~0=v_~x$w_buff1~0_82, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x~0=v_~x~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_25|, ~weak$$choice0~0=v_~weak$$choice0~0_25, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_31|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_46, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ULTIMATE.start_reach_error_#t~nondet0#1.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~weak$$choice2~0, ~x~0][65], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 164#true, 63#L824true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 11#L804true, 103#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue]) [2023-08-26 21:16:00,121 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,121 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,121 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,121 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:00,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L869-->ULTIMATE.startEXIT: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd0~0_In_5 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd0~0_In_5 256) 0))) (let ((.cse8 (not .cse7)) (.cse11 (and (= (mod v_~x$w_buff1_used~0_In_5 256) 0) .cse7)) (.cse12 (= 0 (mod v_~x$w_buff0_used~0_In_5 256))) (.cse6 (and .cse3 .cse7))) (let ((.cse9 (or .cse11 .cse12 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse9 v_~x~0_In_5 (ite .cse10 v_~x$w_buff0~0_In_5 v_~x$w_buff1~0_In_5))) (.cse5 (= (mod v_~x$w_buff1_used~0_Out_10 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_Out_6 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_Out_10 256) 0))) (and (= v_~x~0_Out_10 (ite .cse0 v_~x$mem_tmp~0_Out_6 .cse1)) (= (mod v_~main$tmp_guard1~0_Out_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|) (= |v_ULTIMATE.start_main_#res#1_Out_6| |v_ULTIMATE.start_#t~ret13#1_Out_6|) (= v_~x$flush_delayed~0_Out_6 0) (= |v_#valid_Out_6| (store (store (store (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t737~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t738~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t739~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t740~0#1.base_In_3| 0)) (= |v_ULTIMATE.start_reach_error_#t~nondet0#1.base_In_3| |v_ULTIMATE.start_reach_error_#t~nondet0#1.base_Out_6|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|) (= |v_ULTIMATE.start_main_#res#1_Out_6| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_In_3 0) (= 2 v_~z~0_In_3) (= 2 .cse1) (= 2 v_~__unbuffered_p3_EAX~0_In_3) (= v_~__unbuffered_p3_EBX~0_In_3 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_6) (= v_~x$mem_tmp~0_Out_6 v_~x~0_In_5) (= |v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_Out_6| |v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_In_3|) (= v_~x$w_buff0~0_In_5 v_~x$w_buff0~0_Out_6) (= v_~x$r_buff1_thd0~0_Out_10 (ite .cse0 v_~x$r_buff1_thd0~0_In_5 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_Out_10 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~x$r_buff1_thd0~0_In_5 0))) (= (ite .cse0 v_~x$r_buff0_thd0~0_In_5 (ite (or .cse4 .cse6 (and .cse7 .cse5)) v_~x$r_buff0_thd0~0_In_5 (ite (and .cse8 (not .cse4)) 0 v_~x$r_buff0_thd0~0_In_5))) v_~x$r_buff0_thd0~0_Out_10) (= (ite .cse0 v_~x$w_buff0_used~0_In_5 (ite .cse9 v_~x$w_buff0_used~0_In_5 (ite .cse10 0 v_~x$w_buff0_used~0_In_5))) v_~x$w_buff0_used~0_Out_10) (= v_~x$w_buff1~0_Out_6 v_~x$w_buff1~0_In_5) (= v_~x$w_buff1_used~0_Out_10 (ite .cse0 v_~x$w_buff1_used~0_In_5 (ite (or .cse11 .cse4 .cse6) v_~x$w_buff1_used~0_In_5 0)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_5, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_5, ~x$w_buff1~0=v_~x$w_buff1~0_In_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_In_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_In_3, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_In_5, ULTIMATE.start_main_~#t737~0#1.base=|v_ULTIMATE.start_main_~#t737~0#1.base_In_3|, ULTIMATE.start_main_~#t739~0#1.base=|v_ULTIMATE.start_main_~#t739~0#1.base_In_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_5, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_In_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_3, #valid=|v_#valid_In_3|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_In_3, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_In_3|, ULTIMATE.start_main_~#t738~0#1.base=|v_ULTIMATE.start_main_~#t738~0#1.base_In_3|, ~z~0=v_~z~0_In_3, ULTIMATE.start_main_~#t740~0#1.base=|v_ULTIMATE.start_main_~#t740~0#1.base_In_3|, ~x~0=v_~x~0_In_5} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_6, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6|, ~x$flush_delayed~0=v_~x$flush_delayed~0_Out_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_Out_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_6|, ULTIMATE.start_main_~#t740~0#1.offset=|v_ULTIMATE.start_main_~#t740~0#1.offset_Out_6|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_3, ULTIMATE.start_main_~#t737~0#1.offset=|v_ULTIMATE.start_main_~#t737~0#1.offset_Out_6|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_In_3, ULTIMATE.start_main_~#t739~0#1.offset=|v_ULTIMATE.start_main_~#t739~0#1.offset_Out_6|, ULTIMATE.start_main_~#t738~0#1.offset=|v_ULTIMATE.start_main_~#t738~0#1.offset_Out_6|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_Out_10, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~x$w_buff1~0=v_~x$w_buff1~0_Out_6, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_In_3, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_10, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_10, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_Out_6|, ~weak$$choice0~0=v_~weak$$choice0~0_Out_6, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_6|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|, #valid=|v_#valid_Out_6|, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_Out_6|, ~z~0=v_~z~0_In_3, ~weak$$choice2~0=v_~weak$$choice2~0_Out_6, ~x~0=v_~x~0_Out_10, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_Out_6|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t737~0#1.base, ULTIMATE.start_main_~#t740~0#1.offset, ULTIMATE.start_main_~#t737~0#1.offset, ULTIMATE.start_main_~#t739~0#1.offset, ULTIMATE.start_main_~#t738~0#1.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#res#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_~#t739~0#1.base, ~x$w_buff0_used~0, ULTIMATE.start_reach_error_#t~nondet0#1.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_reach_error_#t~nondet0#1.base, ULTIMATE.start_main_~#t738~0#1.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t740~0#1.base, ~x~0, ULTIMATE.start_#t~ret13#1][64], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 63#L824true, 3#ULTIMATE.startEXITtrue, Black: 164#true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 11#L804true]) [2023-08-26 21:16:00,272 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-26 21:16:00,272 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:00,272 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:00,273 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:01,060 INFO L124 PetriNetUnfolderBase]: 12370/17343 cut-off events. [2023-08-26 21:16:01,060 INFO L125 PetriNetUnfolderBase]: For 11376/12111 co-relation queries the response was YES. [2023-08-26 21:16:01,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51773 conditions, 17343 events. 12370/17343 cut-off events. For 11376/12111 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 102303 event pairs, 3114 based on Foata normal form. 213/14980 useless extension candidates. Maximal degree in co-relation 51758. Up to 12810 conditions per place. [2023-08-26 21:16:01,176 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 59 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-08-26 21:16:01,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 430 flow [2023-08-26 21:16:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-26 21:16:01,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753787878787879 [2023-08-26 21:16:01,179 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-26 21:16:01,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-26 21:16:01,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:01,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-26 21:16:01,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 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-26 21:16:01,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:01,183 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:01,183 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 216 flow. Second operand 4 states and 502 transitions. [2023-08-26 21:16:01,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 430 flow [2023-08-26 21:16:01,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:01,193 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 208 flow [2023-08-26 21:16:01,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-26 21:16:01,194 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-26 21:16:01,194 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 208 flow [2023-08-26 21:16:01,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-26 21:16:01,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:01,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:16:01,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:01,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -530515006, now seen corresponding path program 1 times [2023-08-26 21:16:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520906196] [2023-08-26 21:16:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:01,257 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-26 21:16:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520906196] [2023-08-26 21:16:01,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520906196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:01,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:01,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:16:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489694576] [2023-08-26 21:16:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:01,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:01,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 264 [2023-08-26 21:16:01,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-26 21:16:01,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:01,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 264 [2023-08-26 21:16:01,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:01,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([462] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][37], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 3#ULTIMATE.startEXITtrue, Black: 164#true, Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 119#L811true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), 180#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse, 21#$Ultimate##0true]) [2023-08-26 21:16:01,915 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:16:01,915 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:16:01,915 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:16:01,915 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:16:02,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([462] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][37], [75#L821true, 42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 3#ULTIMATE.startEXITtrue, Black: 164#true, Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 119#L811true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 175#(<= 1 ~__unbuffered_cnt~0), 180#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse]) [2023-08-26 21:16:02,180 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,180 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,180 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,180 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L869-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd0~0_92 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~x$w_buff0_used~0_202 256) 0)) (.cse2 (and .cse8 (= (mod v_~x$w_buff1_used~0_171 256) 0))) (.cse4 (and .cse8 .cse10))) (let ((.cse5 (or .cse12 .cse2 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_170 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_201 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_46 256) 0))) (.cse0 (ite .cse5 v_~x~0_124 (ite .cse6 v_~x$w_buff0~0_97 v_~x$w_buff1~0_82)))) (and (= v_~x$mem_tmp~0_30 v_~x~0_124) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~x$flush_delayed~0_39 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_24 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= 2 .cse0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$w_buff1_used~0_170 (ite .cse1 v_~x$w_buff1_used~0_171 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_171 0))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= (ite .cse1 v_~x$w_buff0_used~0_202 (ite .cse5 v_~x$w_buff0_used~0_202 (ite .cse6 0 v_~x$w_buff0_used~0_202))) v_~x$w_buff0_used~0_201) (= v_~x$w_buff0~0_97 v_~x$w_buff0~0_96) (= (ite .cse1 v_~x$r_buff0_thd0~0_96 (ite (or (and .cse7 .cse8) .cse3 .cse4) v_~x$r_buff0_thd0~0_96 (ite (and (not .cse3) .cse9) 0 v_~x$r_buff0_thd0~0_96))) v_~x$r_buff0_thd0~0_95) (= v_~x$w_buff1~0_82 v_~x$w_buff1~0_81) (= v_~x$r_buff1_thd0~0_91 (ite .cse1 v_~x$r_buff1_thd0~0_92 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_95 256) 0))) (or (and .cse10 .cse11) (and .cse7 .cse11) .cse3)) v_~x$r_buff1_thd0~0_92 0))) (= (ite .cse1 v_~x$mem_tmp~0_30 .cse0) v_~x~0_123)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_97, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x$w_buff1~0=v_~x$w_buff1~0_82, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x~0=v_~x~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_25|, ~weak$$choice0~0=v_~weak$$choice0~0_25, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_31|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_46, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ULTIMATE.start_reach_error_#t~nondet0#1.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~weak$$choice2~0, ~x~0][71], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 164#true, 63#L824true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 103#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, 11#L804true]) [2023-08-26 21:16:02,206 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,206 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,207 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,207 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:02,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L869-->ULTIMATE.startEXIT: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd0~0_In_5 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd0~0_In_5 256) 0))) (let ((.cse8 (not .cse7)) (.cse11 (and (= (mod v_~x$w_buff1_used~0_In_5 256) 0) .cse7)) (.cse12 (= 0 (mod v_~x$w_buff0_used~0_In_5 256))) (.cse6 (and .cse3 .cse7))) (let ((.cse9 (or .cse11 .cse12 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse9 v_~x~0_In_5 (ite .cse10 v_~x$w_buff0~0_In_5 v_~x$w_buff1~0_In_5))) (.cse5 (= (mod v_~x$w_buff1_used~0_Out_10 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_Out_6 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_Out_10 256) 0))) (and (= v_~x~0_Out_10 (ite .cse0 v_~x$mem_tmp~0_Out_6 .cse1)) (= (mod v_~main$tmp_guard1~0_Out_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|) (= |v_ULTIMATE.start_main_#res#1_Out_6| |v_ULTIMATE.start_#t~ret13#1_Out_6|) (= v_~x$flush_delayed~0_Out_6 0) (= |v_#valid_Out_6| (store (store (store (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t737~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t738~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t739~0#1.base_In_3| 0) |v_ULTIMATE.start_main_~#t740~0#1.base_In_3| 0)) (= |v_ULTIMATE.start_reach_error_#t~nondet0#1.base_In_3| |v_ULTIMATE.start_reach_error_#t~nondet0#1.base_Out_6|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|) (= |v_ULTIMATE.start_main_#res#1_Out_6| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_In_3 0) (= 2 v_~z~0_In_3) (= 2 .cse1) (= 2 v_~__unbuffered_p3_EAX~0_In_3) (= v_~__unbuffered_p3_EBX~0_In_3 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_6) (= v_~x$mem_tmp~0_Out_6 v_~x~0_In_5) (= |v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_Out_6| |v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_In_3|) (= v_~x$w_buff0~0_In_5 v_~x$w_buff0~0_Out_6) (= v_~x$r_buff1_thd0~0_Out_10 (ite .cse0 v_~x$r_buff1_thd0~0_In_5 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_Out_10 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~x$r_buff1_thd0~0_In_5 0))) (= (ite .cse0 v_~x$r_buff0_thd0~0_In_5 (ite (or .cse4 .cse6 (and .cse7 .cse5)) v_~x$r_buff0_thd0~0_In_5 (ite (and .cse8 (not .cse4)) 0 v_~x$r_buff0_thd0~0_In_5))) v_~x$r_buff0_thd0~0_Out_10) (= (ite .cse0 v_~x$w_buff0_used~0_In_5 (ite .cse9 v_~x$w_buff0_used~0_In_5 (ite .cse10 0 v_~x$w_buff0_used~0_In_5))) v_~x$w_buff0_used~0_Out_10) (= v_~x$w_buff1~0_Out_6 v_~x$w_buff1~0_In_5) (= v_~x$w_buff1_used~0_Out_10 (ite .cse0 v_~x$w_buff1_used~0_In_5 (ite (or .cse11 .cse4 .cse6) v_~x$w_buff1_used~0_In_5 0)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_5, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_5, ~x$w_buff1~0=v_~x$w_buff1~0_In_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_In_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_In_3, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_In_5, ULTIMATE.start_main_~#t737~0#1.base=|v_ULTIMATE.start_main_~#t737~0#1.base_In_3|, ULTIMATE.start_main_~#t739~0#1.base=|v_ULTIMATE.start_main_~#t739~0#1.base_In_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_5, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_In_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_3, #valid=|v_#valid_In_3|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_In_3, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_In_3|, ULTIMATE.start_main_~#t738~0#1.base=|v_ULTIMATE.start_main_~#t738~0#1.base_In_3|, ~z~0=v_~z~0_In_3, ULTIMATE.start_main_~#t740~0#1.base=|v_ULTIMATE.start_main_~#t740~0#1.base_In_3|, ~x~0=v_~x~0_In_5} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_6, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_6|, ~x$flush_delayed~0=v_~x$flush_delayed~0_Out_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_Out_6, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_6|, ULTIMATE.start_main_~#t740~0#1.offset=|v_ULTIMATE.start_main_~#t740~0#1.offset_Out_6|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_3, ULTIMATE.start_main_~#t737~0#1.offset=|v_ULTIMATE.start_main_~#t737~0#1.offset_Out_6|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_In_3, ULTIMATE.start_main_~#t739~0#1.offset=|v_ULTIMATE.start_main_~#t739~0#1.offset_Out_6|, ULTIMATE.start_main_~#t738~0#1.offset=|v_ULTIMATE.start_main_~#t738~0#1.offset_Out_6|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_Out_10, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~x$w_buff1~0=v_~x$w_buff1~0_Out_6, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_In_3, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_10, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_10, ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_Out_6|, ~weak$$choice0~0=v_~weak$$choice0~0_Out_6, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_6|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_6|, #valid=|v_#valid_Out_6|, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_Out_6|, ~z~0=v_~z~0_In_3, ~weak$$choice2~0=v_~weak$$choice2~0_Out_6, ~x~0=v_~x~0_Out_10, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_Out_6|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t737~0#1.base, ULTIMATE.start_main_~#t740~0#1.offset, ULTIMATE.start_main_~#t737~0#1.offset, ULTIMATE.start_main_~#t739~0#1.offset, ULTIMATE.start_main_~#t738~0#1.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#res#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_~#t739~0#1.base, ~x$w_buff0_used~0, ULTIMATE.start_reach_error_#t~nondet0#1.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #valid, ULTIMATE.start_reach_error_#t~nondet0#1.base, ULTIMATE.start_main_~#t738~0#1.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t740~0#1.base, ~x~0, ULTIMATE.start_#t~ret13#1][70], [42#L784true, Black: 161#(= ~__unbuffered_cnt~0 0), 114#P0EXITtrue, 63#L824true, 3#ULTIMATE.startEXITtrue, Black: 164#true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), 175#(<= 1 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 11#L804true]) [2023-08-26 21:16:02,291 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-26 21:16:02,291 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:02,291 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:02,291 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 21:16:02,571 INFO L124 PetriNetUnfolderBase]: 8916/12528 cut-off events. [2023-08-26 21:16:02,571 INFO L125 PetriNetUnfolderBase]: For 9987/10583 co-relation queries the response was YES. [2023-08-26 21:16:02,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38351 conditions, 12528 events. 8916/12528 cut-off events. For 9987/10583 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 71181 event pairs, 2266 based on Foata normal form. 127/11901 useless extension candidates. Maximal degree in co-relation 38335. Up to 6222 conditions per place. [2023-08-26 21:16:02,657 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 82 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-08-26 21:16:02,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 604 flow [2023-08-26 21:16:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-08-26 21:16:02,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2023-08-26 21:16:02,660 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-08-26 21:16:02,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-08-26 21:16:02,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:02,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-08-26 21:16:02,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 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-26 21:16:02,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:02,665 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:02,665 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 208 flow. Second operand 4 states and 522 transitions. [2023-08-26 21:16:02,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 604 flow [2023-08-26 21:16:02,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:02,670 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 260 flow [2023-08-26 21:16:02,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-08-26 21:16:02,671 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-26 21:16:02,671 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 260 flow [2023-08-26 21:16:02,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-26 21:16:02,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:02,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:02,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:16:02,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:02,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash -928561507, now seen corresponding path program 1 times [2023-08-26 21:16:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507315052] [2023-08-26 21:16:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:03,063 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-26 21:16:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507315052] [2023-08-26 21:16:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507315052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:16:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775089268] [2023-08-26 21:16:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:16:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:16:03,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:16:03,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 264 [2023-08-26 21:16:03,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-26 21:16:03,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:03,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 264 [2023-08-26 21:16:03,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:04,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L824-->L827: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][39], [42#L784true, 164#true, 3#ULTIMATE.startEXITtrue, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 174#(= ~__unbuffered_cnt~0 0), 183#true, P0Thread1of1ForFork1InUse, 179#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, Black: 180#(<= ~__unbuffered_cnt~0 1), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 11#L804true, 98#L761true, 92#L827true]) [2023-08-26 21:16:04,143 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:04,143 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:04,143 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:04,143 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:04,777 INFO L124 PetriNetUnfolderBase]: 11501/16044 cut-off events. [2023-08-26 21:16:04,777 INFO L125 PetriNetUnfolderBase]: For 15512/16023 co-relation queries the response was YES. [2023-08-26 21:16:04,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52665 conditions, 16044 events. 11501/16044 cut-off events. For 15512/16023 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 88194 event pairs, 3937 based on Foata normal form. 153/15325 useless extension candidates. Maximal degree in co-relation 52648. Up to 14065 conditions per place. [2023-08-26 21:16:04,907 INFO L140 encePairwiseOnDemand]: 258/264 looper letters, 57 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-08-26 21:16:04,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 468 flow [2023-08-26 21:16:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:16:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:16:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-26 21:16:04,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-26 21:16:04,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-26 21:16:04,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-26 21:16:04,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:04,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-26 21:16:04,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-26 21:16:04,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:16:04,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:16:04,913 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 260 flow. Second operand 3 states and 388 transitions. [2023-08-26 21:16:04,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 468 flow [2023-08-26 21:16:04,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 450 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:04,929 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 314 flow [2023-08-26 21:16:04,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2023-08-26 21:16:04,930 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-26 21:16:04,930 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 314 flow [2023-08-26 21:16:04,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-26 21:16:04,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:04,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:16:04,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:04,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1279362030, now seen corresponding path program 1 times [2023-08-26 21:16:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:04,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962815723] [2023-08-26 21:16:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:05,509 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-26 21:16:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962815723] [2023-08-26 21:16:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962815723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279191619] [2023-08-26 21:16:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:05,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:05,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-26 21:16:05,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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-26 21:16:05,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:05,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-26 21:16:05,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:06,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L824-->L827: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][54], [42#L784true, 164#true, 3#ULTIMATE.startEXITtrue, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 174#(= ~__unbuffered_cnt~0 0), 183#true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 180#(<= ~__unbuffered_cnt~0 1), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 11#L804true, 98#L761true, Black: 185#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 92#L827true, 188#true]) [2023-08-26 21:16:06,760 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:16:06,760 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:06,760 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:06,760 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:16:07,452 INFO L124 PetriNetUnfolderBase]: 12010/16849 cut-off events. [2023-08-26 21:16:07,453 INFO L125 PetriNetUnfolderBase]: For 17829/18470 co-relation queries the response was YES. [2023-08-26 21:16:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57301 conditions, 16849 events. 12010/16849 cut-off events. For 17829/18470 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 94666 event pairs, 3868 based on Foata normal form. 370/16342 useless extension candidates. Maximal degree in co-relation 57283. Up to 13201 conditions per place. [2023-08-26 21:16:07,550 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 85 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2023-08-26 21:16:07,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 730 flow [2023-08-26 21:16:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-26 21:16:07,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48200757575757575 [2023-08-26 21:16:07,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-26 21:16:07,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-26 21:16:07,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:07,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-26 21:16:07,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-26 21:16:07,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:07,558 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:07,559 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 314 flow. Second operand 4 states and 509 transitions. [2023-08-26 21:16:07,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 730 flow [2023-08-26 21:16:07,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:07,574 INFO L231 Difference]: Finished difference. Result has 59 places, 68 transitions, 434 flow [2023-08-26 21:16:07,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=434, PETRI_PLACES=59, PETRI_TRANSITIONS=68} [2023-08-26 21:16:07,576 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-08-26 21:16:07,576 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 68 transitions, 434 flow [2023-08-26 21:16:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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-26 21:16:07,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:07,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:07,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:16:07,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:07,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1090802783, now seen corresponding path program 1 times [2023-08-26 21:16:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271136253] [2023-08-26 21:16:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:08,060 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-26 21:16:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:08,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271136253] [2023-08-26 21:16:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271136253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:16:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691902664] [2023-08-26 21:16:08,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:08,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:08,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 264 [2023-08-26 21:16:08,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 68 transitions, 434 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-26 21:16:08,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:08,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 264 [2023-08-26 21:16:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:10,016 INFO L124 PetriNetUnfolderBase]: 18653/25309 cut-off events. [2023-08-26 21:16:10,016 INFO L125 PetriNetUnfolderBase]: For 37874/37874 co-relation queries the response was YES. [2023-08-26 21:16:10,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95829 conditions, 25309 events. 18653/25309 cut-off events. For 37874/37874 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 132413 event pairs, 4729 based on Foata normal form. 170/25044 useless extension candidates. Maximal degree in co-relation 95808. Up to 18185 conditions per place. [2023-08-26 21:16:10,183 INFO L140 encePairwiseOnDemand]: 251/264 looper letters, 85 selfloop transitions, 33 changer transitions 0/118 dead transitions. [2023-08-26 21:16:10,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 943 flow [2023-08-26 21:16:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-26 21:16:10,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2023-08-26 21:16:10,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-26 21:16:10,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-26 21:16:10,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:10,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-26 21:16:10,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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-26 21:16:10,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:10,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:10,189 INFO L175 Difference]: Start difference. First operand has 59 places, 68 transitions, 434 flow. Second operand 4 states and 472 transitions. [2023-08-26 21:16:10,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 943 flow [2023-08-26 21:16:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 927 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 21:16:10,218 INFO L231 Difference]: Finished difference. Result has 64 places, 89 transitions, 718 flow [2023-08-26 21:16:10,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=718, PETRI_PLACES=64, PETRI_TRANSITIONS=89} [2023-08-26 21:16:10,219 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-26 21:16:10,219 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 89 transitions, 718 flow [2023-08-26 21:16:10,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-26 21:16:10,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:10,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:10,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:16:10,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:10,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2094750651, now seen corresponding path program 2 times [2023-08-26 21:16:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168272982] [2023-08-26 21:16:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:10,516 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-26 21:16:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168272982] [2023-08-26 21:16:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168272982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178310019] [2023-08-26 21:16:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:10,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-26 21:16:10,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 89 transitions, 718 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-26 21:16:10,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:10,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-26 21:16:10,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:12,503 INFO L124 PetriNetUnfolderBase]: 16013/22462 cut-off events. [2023-08-26 21:16:12,503 INFO L125 PetriNetUnfolderBase]: For 63355/64314 co-relation queries the response was YES. [2023-08-26 21:16:12,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102380 conditions, 22462 events. 16013/22462 cut-off events. For 63355/64314 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 128251 event pairs, 3224 based on Foata normal form. 526/22211 useless extension candidates. Maximal degree in co-relation 102355. Up to 16293 conditions per place. [2023-08-26 21:16:12,682 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 115 selfloop transitions, 28 changer transitions 0/155 dead transitions. [2023-08-26 21:16:12,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 155 transitions, 1445 flow [2023-08-26 21:16:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 21:16:12,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2023-08-26 21:16:12,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 21:16:12,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 21:16:12,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:12,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 21:16:12,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 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-26 21:16:12,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:12,686 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:12,686 INFO L175 Difference]: Start difference. First operand has 64 places, 89 transitions, 718 flow. Second operand 4 states and 520 transitions. [2023-08-26 21:16:12,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 155 transitions, 1445 flow [2023-08-26 21:16:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 155 transitions, 1444 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:12,708 INFO L231 Difference]: Finished difference. Result has 68 places, 106 transitions, 1010 flow [2023-08-26 21:16:12,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1010, PETRI_PLACES=68, PETRI_TRANSITIONS=106} [2023-08-26 21:16:12,709 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-26 21:16:12,709 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 106 transitions, 1010 flow [2023-08-26 21:16:12,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-26 21:16:12,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:12,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:12,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:16:12,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:12,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1945965510, now seen corresponding path program 1 times [2023-08-26 21:16:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295023474] [2023-08-26 21:16:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:13,189 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-26 21:16:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295023474] [2023-08-26 21:16:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295023474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809112385] [2023-08-26 21:16:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:13,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:16:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:13,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:16:13,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:16:13,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 264 [2023-08-26 21:16:13,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 106 transitions, 1010 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-26 21:16:13,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:13,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 264 [2023-08-26 21:16:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:16,499 INFO L124 PetriNetUnfolderBase]: 20791/28077 cut-off events. [2023-08-26 21:16:16,499 INFO L125 PetriNetUnfolderBase]: For 80572/80572 co-relation queries the response was YES. [2023-08-26 21:16:16,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140758 conditions, 28077 events. 20791/28077 cut-off events. For 80572/80572 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 148062 event pairs, 2988 based on Foata normal form. 60/27705 useless extension candidates. Maximal degree in co-relation 140730. Up to 18963 conditions per place. [2023-08-26 21:16:16,717 INFO L140 encePairwiseOnDemand]: 249/264 looper letters, 196 selfloop transitions, 122 changer transitions 0/318 dead transitions. [2023-08-26 21:16:16,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 318 transitions, 3160 flow [2023-08-26 21:16:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:16:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:16:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 974 transitions. [2023-08-26 21:16:16,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46117424242424243 [2023-08-26 21:16:16,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 974 transitions. [2023-08-26 21:16:16,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 974 transitions. [2023-08-26 21:16:16,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:16,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 974 transitions. [2023-08-26 21:16:16,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.75) internal successors, (974), 8 states have internal predecessors, (974), 0 states have call successors, (0), 0 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-26 21:16:16,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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-26 21:16:16,727 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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-26 21:16:16,727 INFO L175 Difference]: Start difference. First operand has 68 places, 106 transitions, 1010 flow. Second operand 8 states and 974 transitions. [2023-08-26 21:16:16,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 318 transitions, 3160 flow [2023-08-26 21:16:16,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 318 transitions, 3107 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:16,813 INFO L231 Difference]: Finished difference. Result has 81 places, 197 transitions, 2446 flow [2023-08-26 21:16:16,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2446, PETRI_PLACES=81, PETRI_TRANSITIONS=197} [2023-08-26 21:16:16,815 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 21:16:16,815 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 197 transitions, 2446 flow [2023-08-26 21:16:16,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-26 21:16:16,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:16,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:16,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:16:16,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:16,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2141393296, now seen corresponding path program 2 times [2023-08-26 21:16:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571986244] [2023-08-26 21:16:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:17,180 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-26 21:16:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571986244] [2023-08-26 21:16:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571986244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425221418] [2023-08-26 21:16:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:16:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:17,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:16:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:16:17,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-26 21:16:17,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 197 transitions, 2446 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 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-26 21:16:17,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:17,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-26 21:16:17,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:20,925 INFO L124 PetriNetUnfolderBase]: 20874/29079 cut-off events. [2023-08-26 21:16:20,925 INFO L125 PetriNetUnfolderBase]: For 186034/187762 co-relation queries the response was YES. [2023-08-26 21:16:21,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176457 conditions, 29079 events. 20874/29079 cut-off events. For 186034/187762 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 170964 event pairs, 2968 based on Foata normal form. 993/28931 useless extension candidates. Maximal degree in co-relation 176421. Up to 16622 conditions per place. [2023-08-26 21:16:21,158 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 165 selfloop transitions, 88 changer transitions 0/292 dead transitions. [2023-08-26 21:16:21,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 292 transitions, 3802 flow [2023-08-26 21:16:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-26 21:16:21,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871212121212121 [2023-08-26 21:16:21,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-26 21:16:21,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-26 21:16:21,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:21,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-26 21:16:21,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 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-26 21:16:21,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:21,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:21,164 INFO L175 Difference]: Start difference. First operand has 81 places, 197 transitions, 2446 flow. Second operand 5 states and 643 transitions. [2023-08-26 21:16:21,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 292 transitions, 3802 flow [2023-08-26 21:16:21,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 292 transitions, 3590 flow, removed 73 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:21,560 INFO L231 Difference]: Finished difference. Result has 85 places, 223 transitions, 2963 flow [2023-08-26 21:16:21,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2963, PETRI_PLACES=85, PETRI_TRANSITIONS=223} [2023-08-26 21:16:21,560 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-26 21:16:21,561 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 223 transitions, 2963 flow [2023-08-26 21:16:21,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 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-26 21:16:21,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:21,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:21,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:16:21,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:21,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1958678799, now seen corresponding path program 1 times [2023-08-26 21:16:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520337758] [2023-08-26 21:16:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:22,115 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-26 21:16:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520337758] [2023-08-26 21:16:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520337758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640860541] [2023-08-26 21:16:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:22,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:16:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:16:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:16:22,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 264 [2023-08-26 21:16:22,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 223 transitions, 2963 flow. Second operand has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-26 21:16:22,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:22,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 264 [2023-08-26 21:16:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:26,653 INFO L124 PetriNetUnfolderBase]: 22906/32038 cut-off events. [2023-08-26 21:16:26,653 INFO L125 PetriNetUnfolderBase]: For 239406/241416 co-relation queries the response was YES. [2023-08-26 21:16:26,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206977 conditions, 32038 events. 22906/32038 cut-off events. For 239406/241416 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 191929 event pairs, 3692 based on Foata normal form. 928/31968 useless extension candidates. Maximal degree in co-relation 206938. Up to 20834 conditions per place. [2023-08-26 21:16:26,971 INFO L140 encePairwiseOnDemand]: 254/264 looper letters, 202 selfloop transitions, 73 changer transitions 0/314 dead transitions. [2023-08-26 21:16:26,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 314 transitions, 4373 flow [2023-08-26 21:16:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-08-26 21:16:26,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478030303030303 [2023-08-26 21:16:26,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-08-26 21:16:26,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-08-26 21:16:26,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:26,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-08-26 21:16:26,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 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-26 21:16:26,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:26,977 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:26,978 INFO L175 Difference]: Start difference. First operand has 85 places, 223 transitions, 2963 flow. Second operand 5 states and 631 transitions. [2023-08-26 21:16:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 314 transitions, 4373 flow [2023-08-26 21:16:27,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 314 transitions, 4252 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:27,462 INFO L231 Difference]: Finished difference. Result has 89 places, 243 transitions, 3431 flow [2023-08-26 21:16:27,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2866, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3431, PETRI_PLACES=89, PETRI_TRANSITIONS=243} [2023-08-26 21:16:27,462 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2023-08-26 21:16:27,463 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 243 transitions, 3431 flow [2023-08-26 21:16:27,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-26 21:16:27,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:27,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:16:27,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:27,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1253890115, now seen corresponding path program 1 times [2023-08-26 21:16:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:27,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700193154] [2023-08-26 21:16:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:27,773 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-26 21:16:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700193154] [2023-08-26 21:16:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700193154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412100560] [2023-08-26 21:16:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:27,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:27,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 264 [2023-08-26 21:16:27,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 243 transitions, 3431 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 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-26 21:16:27,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:27,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 264 [2023-08-26 21:16:27,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:30,904 INFO L124 PetriNetUnfolderBase]: 15724/22302 cut-off events. [2023-08-26 21:16:30,904 INFO L125 PetriNetUnfolderBase]: For 273329/284821 co-relation queries the response was YES. [2023-08-26 21:16:31,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150405 conditions, 22302 events. 15724/22302 cut-off events. For 273329/284821 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 135341 event pairs, 2043 based on Foata normal form. 3908/24836 useless extension candidates. Maximal degree in co-relation 150364. Up to 13018 conditions per place. [2023-08-26 21:16:31,111 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 464 selfloop transitions, 10 changer transitions 0/520 dead transitions. [2023-08-26 21:16:31,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 520 transitions, 8819 flow [2023-08-26 21:16:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-26 21:16:31,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-26 21:16:31,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-26 21:16:31,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-26 21:16:31,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:31,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-26 21:16:31,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 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-26 21:16:31,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:31,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:31,116 INFO L175 Difference]: Start difference. First operand has 89 places, 243 transitions, 3431 flow. Second operand 5 states and 627 transitions. [2023-08-26 21:16:31,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 520 transitions, 8819 flow [2023-08-26 21:16:31,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 520 transitions, 8361 flow, removed 103 selfloop flow, removed 3 redundant places. [2023-08-26 21:16:31,393 INFO L231 Difference]: Finished difference. Result has 93 places, 239 transitions, 3231 flow [2023-08-26 21:16:31,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3231, PETRI_PLACES=93, PETRI_TRANSITIONS=239} [2023-08-26 21:16:31,393 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-26 21:16:31,394 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 239 transitions, 3231 flow [2023-08-26 21:16:31,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 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-26 21:16:31,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:31,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:31,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:16:31,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:31,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash -983051892, now seen corresponding path program 1 times [2023-08-26 21:16:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920412315] [2023-08-26 21:16:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:31,569 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-26 21:16:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920412315] [2023-08-26 21:16:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920412315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246201072] [2023-08-26 21:16:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:31,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:31,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:31,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 264 [2023-08-26 21:16:31,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 239 transitions, 3231 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 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-26 21:16:31,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:31,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 264 [2023-08-26 21:16:31,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:33,764 INFO L124 PetriNetUnfolderBase]: 10543/15233 cut-off events. [2023-08-26 21:16:33,764 INFO L125 PetriNetUnfolderBase]: For 204856/216145 co-relation queries the response was YES. [2023-08-26 21:16:34,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101492 conditions, 15233 events. 10543/15233 cut-off events. For 204856/216145 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 91341 event pairs, 1026 based on Foata normal form. 3439/17408 useless extension candidates. Maximal degree in co-relation 101448. Up to 8235 conditions per place. [2023-08-26 21:16:34,067 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 522 selfloop transitions, 19 changer transitions 0/581 dead transitions. [2023-08-26 21:16:34,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 581 transitions, 9528 flow [2023-08-26 21:16:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:16:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:16:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-08-26 21:16:34,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2023-08-26 21:16:34,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-08-26 21:16:34,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-08-26 21:16:34,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:34,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-08-26 21:16:34,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-26 21:16:34,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-26 21:16:34,075 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-26 21:16:34,075 INFO L175 Difference]: Start difference. First operand has 93 places, 239 transitions, 3231 flow. Second operand 7 states and 876 transitions. [2023-08-26 21:16:34,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 581 transitions, 9528 flow [2023-08-26 21:16:34,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 581 transitions, 9514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:34,240 INFO L231 Difference]: Finished difference. Result has 100 places, 205 transitions, 2780 flow [2023-08-26 21:16:34,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2780, PETRI_PLACES=100, PETRI_TRANSITIONS=205} [2023-08-26 21:16:34,241 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-26 21:16:34,241 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 205 transitions, 2780 flow [2023-08-26 21:16:34,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 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-26 21:16:34,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:34,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:34,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:16:34,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:34,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1553318640, now seen corresponding path program 1 times [2023-08-26 21:16:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:34,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798328799] [2023-08-26 21:16:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:34,312 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-26 21:16:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798328799] [2023-08-26 21:16:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798328799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969410244] [2023-08-26 21:16:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:34,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 264 [2023-08-26 21:16:34,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 205 transitions, 2780 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-26 21:16:34,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:34,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 264 [2023-08-26 21:16:34,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:36,365 INFO L124 PetriNetUnfolderBase]: 9563/13856 cut-off events. [2023-08-26 21:16:36,366 INFO L125 PetriNetUnfolderBase]: For 174438/182412 co-relation queries the response was YES. [2023-08-26 21:16:36,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95818 conditions, 13856 events. 9563/13856 cut-off events. For 174438/182412 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 82609 event pairs, 1104 based on Foata normal form. 1871/14979 useless extension candidates. Maximal degree in co-relation 95771. Up to 7860 conditions per place. [2023-08-26 21:16:36,473 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 329 selfloop transitions, 21 changer transitions 0/390 dead transitions. [2023-08-26 21:16:36,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 390 transitions, 6193 flow [2023-08-26 21:16:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-26 21:16:36,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893939393939394 [2023-08-26 21:16:36,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-26 21:16:36,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-26 21:16:36,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:36,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-26 21:16:36,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-26 21:16:36,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:36,479 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:36,479 INFO L175 Difference]: Start difference. First operand has 100 places, 205 transitions, 2780 flow. Second operand 5 states and 646 transitions. [2023-08-26 21:16:36,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 390 transitions, 6193 flow [2023-08-26 21:16:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 390 transitions, 6159 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:16:36,768 INFO L231 Difference]: Finished difference. Result has 101 places, 209 transitions, 2840 flow [2023-08-26 21:16:36,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2746, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2840, PETRI_PLACES=101, PETRI_TRANSITIONS=209} [2023-08-26 21:16:36,769 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2023-08-26 21:16:36,769 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 209 transitions, 2840 flow [2023-08-26 21:16:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-26 21:16:36,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:36,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:36,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:16:36,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:36,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1472965357, now seen corresponding path program 1 times [2023-08-26 21:16:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491116536] [2023-08-26 21:16:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:36,963 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-26 21:16:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:36,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491116536] [2023-08-26 21:16:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491116536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:36,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:16:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793601406] [2023-08-26 21:16:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:16:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:16:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:16:36,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 264 [2023-08-26 21:16:36,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 209 transitions, 2840 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-26 21:16:36,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:36,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 264 [2023-08-26 21:16:36,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:38,811 INFO L124 PetriNetUnfolderBase]: 8836/12447 cut-off events. [2023-08-26 21:16:38,811 INFO L125 PetriNetUnfolderBase]: For 180921/190791 co-relation queries the response was YES. [2023-08-26 21:16:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87636 conditions, 12447 events. 8836/12447 cut-off events. For 180921/190791 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 70988 event pairs, 534 based on Foata normal form. 2427/14203 useless extension candidates. Maximal degree in co-relation 87588. Up to 7211 conditions per place. [2023-08-26 21:16:38,899 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 511 selfloop transitions, 28 changer transitions 4/582 dead transitions. [2023-08-26 21:16:38,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 582 transitions, 9548 flow [2023-08-26 21:16:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:16:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:16:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1123 transitions. [2023-08-26 21:16:38,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47264309764309764 [2023-08-26 21:16:38,902 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1123 transitions. [2023-08-26 21:16:38,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1123 transitions. [2023-08-26 21:16:38,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:38,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1123 transitions. [2023-08-26 21:16:38,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.77777777777777) internal successors, (1123), 9 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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-26 21:16:38,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 264.0) internal successors, (2640), 10 states have internal predecessors, (2640), 0 states have call successors, (0), 0 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-26 21:16:38,909 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 264.0) internal successors, (2640), 10 states have internal predecessors, (2640), 0 states have call successors, (0), 0 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-26 21:16:38,909 INFO L175 Difference]: Start difference. First operand has 101 places, 209 transitions, 2840 flow. Second operand 9 states and 1123 transitions. [2023-08-26 21:16:38,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 582 transitions, 9548 flow [2023-08-26 21:16:39,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 582 transitions, 8939 flow, removed 177 selfloop flow, removed 6 redundant places. [2023-08-26 21:16:39,482 INFO L231 Difference]: Finished difference. Result has 106 places, 190 transitions, 2440 flow [2023-08-26 21:16:39,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2440, PETRI_PLACES=106, PETRI_TRANSITIONS=190} [2023-08-26 21:16:39,483 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2023-08-26 21:16:39,483 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 190 transitions, 2440 flow [2023-08-26 21:16:39,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-26 21:16:39,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:39,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:39,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:16:39,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:39,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1655812791, now seen corresponding path program 1 times [2023-08-26 21:16:39,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846588651] [2023-08-26 21:16:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:39,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:39,643 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-26 21:16:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846588651] [2023-08-26 21:16:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846588651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965973185] [2023-08-26 21:16:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:39,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:39,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 264 [2023-08-26 21:16:39,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 190 transitions, 2440 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-26 21:16:39,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:39,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 264 [2023-08-26 21:16:39,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:42,290 INFO L124 PetriNetUnfolderBase]: 12825/18850 cut-off events. [2023-08-26 21:16:42,290 INFO L125 PetriNetUnfolderBase]: For 190607/195731 co-relation queries the response was YES. [2023-08-26 21:16:42,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124595 conditions, 18850 events. 12825/18850 cut-off events. For 190607/195731 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 120205 event pairs, 1632 based on Foata normal form. 1690/19776 useless extension candidates. Maximal degree in co-relation 124546. Up to 10413 conditions per place. [2023-08-26 21:16:42,479 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 332 selfloop transitions, 8 changer transitions 3/375 dead transitions. [2023-08-26 21:16:42,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 375 transitions, 5524 flow [2023-08-26 21:16:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-26 21:16:42,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952651515151515 [2023-08-26 21:16:42,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-26 21:16:42,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-26 21:16:42,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:42,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-26 21:16:42,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-26 21:16:42,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:42,487 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-26 21:16:42,487 INFO L175 Difference]: Start difference. First operand has 106 places, 190 transitions, 2440 flow. Second operand 4 states and 523 transitions. [2023-08-26 21:16:42,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 375 transitions, 5524 flow [2023-08-26 21:16:43,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 375 transitions, 5333 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-26 21:16:43,357 INFO L231 Difference]: Finished difference. Result has 104 places, 194 transitions, 2448 flow [2023-08-26 21:16:43,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2448, PETRI_PLACES=104, PETRI_TRANSITIONS=194} [2023-08-26 21:16:43,358 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2023-08-26 21:16:43,358 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 194 transitions, 2448 flow [2023-08-26 21:16:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-26 21:16:43,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:43,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:16:43,359 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:43,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -49647907, now seen corresponding path program 2 times [2023-08-26 21:16:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421742000] [2023-08-26 21:16:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:43,582 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-26 21:16:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421742000] [2023-08-26 21:16:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421742000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:16:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867284737] [2023-08-26 21:16:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:16:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:16:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:16:43,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 264 [2023-08-26 21:16:43,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 194 transitions, 2448 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 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-26 21:16:43,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:43,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 264 [2023-08-26 21:16:43,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:46,357 INFO L124 PetriNetUnfolderBase]: 12342/17336 cut-off events. [2023-08-26 21:16:46,357 INFO L125 PetriNetUnfolderBase]: For 217877/230998 co-relation queries the response was YES. [2023-08-26 21:16:46,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113913 conditions, 17336 events. 12342/17336 cut-off events. For 217877/230998 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 104104 event pairs, 565 based on Foata normal form. 2981/19515 useless extension candidates. Maximal degree in co-relation 113864. Up to 9993 conditions per place. [2023-08-26 21:16:46,432 INFO L140 encePairwiseOnDemand]: 253/264 looper letters, 366 selfloop transitions, 32 changer transitions 138/565 dead transitions. [2023-08-26 21:16:46,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 565 transitions, 8654 flow [2023-08-26 21:16:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:16:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:16:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1344 transitions. [2023-08-26 21:16:46,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2023-08-26 21:16:46,436 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1344 transitions. [2023-08-26 21:16:46,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1344 transitions. [2023-08-26 21:16:46,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:46,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1344 transitions. [2023-08-26 21:16:46,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.18181818181819) internal successors, (1344), 11 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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-26 21:16:46,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 0 states have call successors, (0), 0 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-26 21:16:46,443 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 0 states have call successors, (0), 0 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-26 21:16:46,443 INFO L175 Difference]: Start difference. First operand has 104 places, 194 transitions, 2448 flow. Second operand 11 states and 1344 transitions. [2023-08-26 21:16:46,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 565 transitions, 8654 flow [2023-08-26 21:16:47,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 565 transitions, 8457 flow, removed 53 selfloop flow, removed 3 redundant places. [2023-08-26 21:16:47,634 INFO L231 Difference]: Finished difference. Result has 110 places, 153 transitions, 1925 flow [2023-08-26 21:16:47,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1925, PETRI_PLACES=110, PETRI_TRANSITIONS=153} [2023-08-26 21:16:47,635 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2023-08-26 21:16:47,635 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 153 transitions, 1925 flow [2023-08-26 21:16:47,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 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-26 21:16:47,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:47,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:47,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:16:47,636 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:47,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash 116309530, now seen corresponding path program 1 times [2023-08-26 21:16:47,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:47,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166609715] [2023-08-26 21:16:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:47,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:47,818 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-26 21:16:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166609715] [2023-08-26 21:16:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166609715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:16:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477026351] [2023-08-26 21:16:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:47,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:16:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:16:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:16:47,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 264 [2023-08-26 21:16:47,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 153 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:47,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:47,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 264 [2023-08-26 21:16:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:50,043 INFO L124 PetriNetUnfolderBase]: 11758/17495 cut-off events. [2023-08-26 21:16:50,043 INFO L125 PetriNetUnfolderBase]: For 151259/154582 co-relation queries the response was YES. [2023-08-26 21:16:50,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110831 conditions, 17495 events. 11758/17495 cut-off events. For 151259/154582 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 114359 event pairs, 2972 based on Foata normal form. 473/17495 useless extension candidates. Maximal degree in co-relation 110791. Up to 8980 conditions per place. [2023-08-26 21:16:50,138 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 101 selfloop transitions, 5 changer transitions 119/233 dead transitions. [2023-08-26 21:16:50,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 233 transitions, 3281 flow [2023-08-26 21:16:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:16:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:16:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 21:16:50,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-08-26 21:16:50,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 21:16:50,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 21:16:50,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:50,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 21:16:50,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-26 21:16:50,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:16:50,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-26 21:16:50,143 INFO L175 Difference]: Start difference. First operand has 110 places, 153 transitions, 1925 flow. Second operand 3 states and 384 transitions. [2023-08-26 21:16:50,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 233 transitions, 3281 flow [2023-08-26 21:16:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 233 transitions, 2981 flow, removed 44 selfloop flow, removed 15 redundant places. [2023-08-26 21:16:51,272 INFO L231 Difference]: Finished difference. Result has 95 places, 98 transitions, 972 flow [2023-08-26 21:16:51,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=95, PETRI_TRANSITIONS=98} [2023-08-26 21:16:51,272 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2023-08-26 21:16:51,272 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 972 flow [2023-08-26 21:16:51,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:51,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:51,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:51,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:16:51,273 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:51,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1254053470, now seen corresponding path program 2 times [2023-08-26 21:16:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213377665] [2023-08-26 21:16:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:51,666 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-26 21:16:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213377665] [2023-08-26 21:16:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213377665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742625706] [2023-08-26 21:16:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:51,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:51,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 264 [2023-08-26 21:16:51,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 972 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-26 21:16:51,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:51,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 264 [2023-08-26 21:16:51,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:52,929 INFO L124 PetriNetUnfolderBase]: 7087/10694 cut-off events. [2023-08-26 21:16:52,929 INFO L125 PetriNetUnfolderBase]: For 59204/59204 co-relation queries the response was YES. [2023-08-26 21:16:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59326 conditions, 10694 events. 7087/10694 cut-off events. For 59204/59204 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 62416 event pairs, 1621 based on Foata normal form. 1/10695 useless extension candidates. Maximal degree in co-relation 59283. Up to 5197 conditions per place. [2023-08-26 21:16:52,971 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 59 selfloop transitions, 8 changer transitions 139/206 dead transitions. [2023-08-26 21:16:52,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 206 transitions, 2321 flow [2023-08-26 21:16:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:16:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:16:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-08-26 21:16:52,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2023-08-26 21:16:52,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-08-26 21:16:52,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-08-26 21:16:52,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:52,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-08-26 21:16:52,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-26 21:16:52,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:52,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:52,977 INFO L175 Difference]: Start difference. First operand has 95 places, 98 transitions, 972 flow. Second operand 6 states and 671 transitions. [2023-08-26 21:16:52,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 206 transitions, 2321 flow [2023-08-26 21:16:53,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 206 transitions, 2241 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-08-26 21:16:53,258 INFO L231 Difference]: Finished difference. Result has 96 places, 56 transitions, 525 flow [2023-08-26 21:16:53,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=96, PETRI_TRANSITIONS=56} [2023-08-26 21:16:53,258 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2023-08-26 21:16:53,258 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 56 transitions, 525 flow [2023-08-26 21:16:53,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-26 21:16:53,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:53,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:16:53,259 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:53,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 570897664, now seen corresponding path program 3 times [2023-08-26 21:16:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669055350] [2023-08-26 21:16:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:54,282 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-26 21:16:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669055350] [2023-08-26 21:16:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669055350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:16:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573245621] [2023-08-26 21:16:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:54,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:16:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:16:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:16:54,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 264 [2023-08-26 21:16:54,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 56 transitions, 525 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-26 21:16:54,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:54,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 264 [2023-08-26 21:16:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:54,804 INFO L124 PetriNetUnfolderBase]: 1375/2164 cut-off events. [2023-08-26 21:16:54,804 INFO L125 PetriNetUnfolderBase]: For 8762/8762 co-relation queries the response was YES. [2023-08-26 21:16:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11403 conditions, 2164 events. 1375/2164 cut-off events. For 8762/8762 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9747 event pairs, 181 based on Foata normal form. 1/2165 useless extension candidates. Maximal degree in co-relation 11370. Up to 1261 conditions per place. [2023-08-26 21:16:54,819 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 65 selfloop transitions, 15 changer transitions 23/103 dead transitions. [2023-08-26 21:16:54,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 1038 flow [2023-08-26 21:16:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:16:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:16:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2023-08-26 21:16:54,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071969696969697 [2023-08-26 21:16:54,822 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions. [2023-08-26 21:16:54,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions. [2023-08-26 21:16:54,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:54,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions. [2023-08-26 21:16:54,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-26 21:16:54,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:54,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:54,827 INFO L175 Difference]: Start difference. First operand has 96 places, 56 transitions, 525 flow. Second operand 6 states and 645 transitions. [2023-08-26 21:16:54,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 1038 flow [2023-08-26 21:16:54,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 852 flow, removed 54 selfloop flow, removed 21 redundant places. [2023-08-26 21:16:54,866 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 445 flow [2023-08-26 21:16:54,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2023-08-26 21:16:54,867 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 21:16:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 445 flow [2023-08-26 21:16:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-26 21:16:54,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:54,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:54,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 21:16:54,868 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:54,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1673660022, now seen corresponding path program 4 times [2023-08-26 21:16:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292638010] [2023-08-26 21:16:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:55,910 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-26 21:16:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292638010] [2023-08-26 21:16:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292638010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:16:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540115803] [2023-08-26 21:16:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:16:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:16:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:16:55,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2023-08-26 21:16:55,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 445 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 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-26 21:16:55,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:55,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2023-08-26 21:16:55,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:56,195 INFO L124 PetriNetUnfolderBase]: 1264/2089 cut-off events. [2023-08-26 21:16:56,196 INFO L125 PetriNetUnfolderBase]: For 6448/6456 co-relation queries the response was YES. [2023-08-26 21:16:56,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9763 conditions, 2089 events. 1264/2089 cut-off events. For 6448/6456 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10142 event pairs, 237 based on Foata normal form. 9/2064 useless extension candidates. Maximal degree in co-relation 9736. Up to 997 conditions per place. [2023-08-26 21:16:56,203 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 58 selfloop transitions, 8 changer transitions 19/89 dead transitions. [2023-08-26 21:16:56,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 784 flow [2023-08-26 21:16:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2023-08-26 21:16:56,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-08-26 21:16:56,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2023-08-26 21:16:56,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2023-08-26 21:16:56,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:56,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2023-08-26 21:16:56,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-26 21:16:56,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:56,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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-26 21:16:56,208 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 445 flow. Second operand 5 states and 576 transitions. [2023-08-26 21:16:56,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 784 flow [2023-08-26 21:16:56,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 728 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-08-26 21:16:56,234 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 399 flow [2023-08-26 21:16:56,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-26 21:16:56,235 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 21:16:56,235 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 399 flow [2023-08-26 21:16:56,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 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-26 21:16:56,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:56,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 21:16:56,236 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:56,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1747304042, now seen corresponding path program 5 times [2023-08-26 21:16:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:56,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100806057] [2023-08-26 21:16:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:16:56,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:16:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:16:56,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:16:56,364 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:16:56,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:16:56,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (19 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:16:56,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:16:56,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (6 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:16:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:16:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 21:16:56,370 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:56,374 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:16:56,375 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:16:56,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:16:56 BasicIcfg [2023-08-26 21:16:56,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:16:56,460 INFO L158 Benchmark]: Toolchain (without parser) took 71799.68ms. Allocated memory was 367.0MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 342.1MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 21:16:56,460 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 367.0MB. Free memory is still 343.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:16:56,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.13ms. Allocated memory is still 367.0MB. Free memory was 342.1MB in the beginning and 318.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:16:56,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.44ms. Allocated memory is still 367.0MB. Free memory was 318.0MB in the beginning and 314.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:16:56,461 INFO L158 Benchmark]: Boogie Preprocessor took 28.59ms. Allocated memory is still 367.0MB. Free memory was 314.8MB in the beginning and 312.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:16:56,461 INFO L158 Benchmark]: RCFGBuilder took 634.13ms. Allocated memory is still 367.0MB. Free memory was 312.7MB in the beginning and 327.6MB in the end (delta: -14.9MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. [2023-08-26 21:16:56,461 INFO L158 Benchmark]: TraceAbstraction took 70581.48ms. Allocated memory was 367.0MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 327.6MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 21:16:56,462 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 367.0MB. Free memory is still 343.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 492.13ms. Allocated memory is still 367.0MB. Free memory was 342.1MB in the beginning and 318.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.44ms. Allocated memory is still 367.0MB. Free memory was 318.0MB in the beginning and 314.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.59ms. Allocated memory is still 367.0MB. Free memory was 314.8MB in the beginning and 312.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 634.13ms. Allocated memory is still 367.0MB. Free memory was 312.7MB in the beginning and 327.6MB in the end (delta: -14.9MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. * TraceAbstraction took 70581.48ms. Allocated memory was 367.0MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 327.6MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 4526 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 122 TotalNumberOfCompositions, 17801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5980, independent: 5594, independent conditional: 0, independent unconditional: 5594, dependent: 386, dependent conditional: 0, dependent unconditional: 386, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2507, independent: 2433, independent conditional: 0, independent unconditional: 2433, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5980, independent: 3161, independent conditional: 0, independent unconditional: 3161, dependent: 312, dependent conditional: 0, dependent unconditional: 312, unknown: 2507, unknown conditional: 0, unknown unconditional: 2507] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L793] EXPR 2 __unbuffered_cnt + 1 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L763] EXPR 1 __unbuffered_cnt + 1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L813] EXPR 3 __unbuffered_cnt + 1 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] EXPR 4 __unbuffered_cnt + 1 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix027_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 763]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 70.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 57.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2860 IncrementalHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 57 mSDtfsCounter, 2860 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3431occurred in iteration=12, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 3358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:16:56,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...