/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/mix007.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:10:37,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:10:37,549 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:10:37,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:10:37,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:10:37,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:10:37,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:10:37,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:10:37,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:10:37,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:10:37,574 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:10:37,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:10:37,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:10:37,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:10:37,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:10:37,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:10:37,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:10:37,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:10:37,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:10:37,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:10:37,576 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:10:37,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:10:37,577 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:10:37,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:10:37,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:10:37,577 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:10:37,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:10:37,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:10:37,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:10:37,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:10:37,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:10:37,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:10:37,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:10:37,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:10:37,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:10:37,579 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:10:37,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:10:37,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:10:37,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:10:37,853 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:10:37,855 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:10:37,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-26 21:10:38,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:10:38,966 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:10:38,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-26 21:10:38,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba79d66b8/7593dfc37e484a088c3b8c2bd8e928d9/FLAGe5748a215 [2023-08-26 21:10:39,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba79d66b8/7593dfc37e484a088c3b8c2bd8e928d9 [2023-08-26 21:10:39,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:10:39,003 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:10:39,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:10:39,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:10:39,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:10:39,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3918a823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39, skipping insertion in model container [2023-08-26 21:10:39,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:10:39,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:10:39,363 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:10:39,382 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:10:39,383 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:10:39,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:10:39,442 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:10:39,442 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:10:39,447 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:10:39,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39 WrapperNode [2023-08-26 21:10:39,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:10:39,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:10:39,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:10:39,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:10:39,454 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:10:39" (1/1) ... [2023-08-26 21:10:39,479 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:10:39" (1/1) ... [2023-08-26 21:10:39,505 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-26 21:10:39,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:10:39,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:10:39,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:10:39,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:10:39,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:10:39,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:10:39,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:10:39,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:10:39,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (1/1) ... [2023-08-26 21:10:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:10:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:10:39,550 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:10:39,557 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:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:10:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:10:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:10:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:10:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:10:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:10:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:10:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:10:39,574 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:10:39,672 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:10:39,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:10:39,968 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:10:40,027 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:10:40,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:10:40,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:10:40 BoogieIcfgContainer [2023-08-26 21:10:40,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:10:40,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:10:40,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:10:40,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:10:40,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:10:39" (1/3) ... [2023-08-26 21:10:40,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f3714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:10:40, skipping insertion in model container [2023-08-26 21:10:40,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:10:39" (2/3) ... [2023-08-26 21:10:40,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f3714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:10:40, skipping insertion in model container [2023-08-26 21:10:40,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:10:40" (3/3) ... [2023-08-26 21:10:40,034 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2023-08-26 21:10:40,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:10:40,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:10:40,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:10:40,095 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:10:40,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:10:40,176 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:10:40,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:10:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:10:40,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:10:40,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-26 21:10:40,192 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:10:40,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:10:40,199 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:10:40,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-26 21:10:40,239 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:10:40,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:10:40,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:10:40,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 4682 [2023-08-26 21:10:43,660 INFO L134 LiptonReduction]: Checked pairs total: 18430 [2023-08-26 21:10:43,660 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 21:10:43,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:10:43,672 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;@24c38dcb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:10:43,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:10:43,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:10:43,674 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 21:10:43,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:10:43,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:43,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:10:43,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:43,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 631758, now seen corresponding path program 1 times [2023-08-26 21:10:43,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:43,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756288632] [2023-08-26 21:10:43,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:43,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:43,940 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:10:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756288632] [2023-08-26 21:10:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756288632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398351646] [2023-08-26 21:10:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:43,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:43,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-26 21:10:43,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:10:43,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:43,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-26 21:10:43,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:45,343 INFO L124 PetriNetUnfolderBase]: 12064/17909 cut-off events. [2023-08-26 21:10:45,344 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-26 21:10:45,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34352 conditions, 17909 events. 12064/17909 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 124152 event pairs, 1764 based on Foata normal form. 0/14074 useless extension candidates. Maximal degree in co-relation 34340. Up to 13549 conditions per place. [2023-08-26 21:10:45,438 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 21:10:45,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-26 21:10:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 21:10:45,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181023720349563 [2023-08-26 21:10:45,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 21:10:45,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 21:10:45,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:45,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 21:10:45,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 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:10:45,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:45,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:45,457 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 415 transitions. [2023-08-26 21:10:45,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-26 21:10:45,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:10:45,461 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:10:45,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:10:45,464 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:10:45,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:10:45,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:10:45,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:45,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:10:45,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:10:45,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:45,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1641308082, now seen corresponding path program 1 times [2023-08-26 21:10:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939986629] [2023-08-26 21:10:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:45,510 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:10:45,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:45,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939986629] [2023-08-26 21:10:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939986629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969112656] [2023-08-26 21:10:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:45,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:45,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:10:45,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:45,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:45,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:46,798 INFO L124 PetriNetUnfolderBase]: 12064/16234 cut-off events. [2023-08-26 21:10:46,798 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-26 21:10:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33487 conditions, 16234 events. 12064/16234 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 87154 event pairs, 12064 based on Foata normal form. 0/12306 useless extension candidates. Maximal degree in co-relation 33477. Up to 16125 conditions per place. [2023-08-26 21:10:46,859 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 28 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 21:10:46,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 138 flow [2023-08-26 21:10:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-26 21:10:46,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47191011235955055 [2023-08-26 21:10:46,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-26 21:10:46,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-26 21:10:46,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:46,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-26 21:10:46,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:10:46,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:46,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:46,864 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 378 transitions. [2023-08-26 21:10:46,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 138 flow [2023-08-26 21:10:46,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:46,866 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-26 21:10:46,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 21:10:46,866 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-26 21:10:46,866 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-26 21:10:46,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:10:46,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:46,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:10:46,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:10:46,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:46,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1641308083, now seen corresponding path program 1 times [2023-08-26 21:10:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909836106] [2023-08-26 21:10:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:46,920 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:10:46,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909836106] [2023-08-26 21:10:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909836106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:46,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:46,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362991786] [2023-08-26 21:10:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:46,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:46,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:46,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:10:46,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:46,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:46,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:47,707 INFO L124 PetriNetUnfolderBase]: 7784/10744 cut-off events. [2023-08-26 21:10:47,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:10:47,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21665 conditions, 10744 events. 7784/10744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 58978 event pairs, 2133 based on Foata normal form. 0/8731 useless extension candidates. Maximal degree in co-relation 21659. Up to 8563 conditions per place. [2023-08-26 21:10:47,856 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-26 21:10:47,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 234 flow [2023-08-26 21:10:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-26 21:10:47,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006242197253433 [2023-08-26 21:10:47,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-26 21:10:47,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-26 21:10:47,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:47,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-26 21:10:47,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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:10:47,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:47,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:47,861 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 401 transitions. [2023-08-26 21:10:47,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 234 flow [2023-08-26 21:10:47,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:47,862 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-26 21:10:47,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:10:47,864 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-26 21:10:47,864 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-26 21:10:47,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:10:47,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:47,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:10:47,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:47,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1709027902, now seen corresponding path program 1 times [2023-08-26 21:10:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913695715] [2023-08-26 21:10:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:48,054 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:10:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:48,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913695715] [2023-08-26 21:10:48,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913695715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:48,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:48,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340147535] [2023-08-26 21:10:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:48,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:48,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:10:48,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:10:48,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:48,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:10:48,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:50,908 INFO L124 PetriNetUnfolderBase]: 31657/43172 cut-off events. [2023-08-26 21:10:50,908 INFO L125 PetriNetUnfolderBase]: For 4113/4113 co-relation queries the response was YES. [2023-08-26 21:10:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101886 conditions, 43172 events. 31657/43172 cut-off events. For 4113/4113 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 246388 event pairs, 11591 based on Foata normal form. 0/37764 useless extension candidates. Maximal degree in co-relation 101878. Up to 27515 conditions per place. [2023-08-26 21:10:51,100 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 64 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2023-08-26 21:10:51,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 366 flow [2023-08-26 21:10:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-26 21:10:51,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-26 21:10:51,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-26 21:10:51,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-26 21:10:51,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:51,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-26 21:10:51,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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:10:51,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:51,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:51,105 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 3 states and 390 transitions. [2023-08-26 21:10:51,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 366 flow [2023-08-26 21:10:51,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:51,109 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 181 flow [2023-08-26 21:10:51,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-26 21:10:51,111 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:10:51,111 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 181 flow [2023-08-26 21:10:51,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:10:51,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:51,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:51,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:10:51,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:51,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1818907222, now seen corresponding path program 1 times [2023-08-26 21:10:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221235376] [2023-08-26 21:10:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:51,179 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:10:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:51,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221235376] [2023-08-26 21:10:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221235376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:51,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:51,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:10:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089075166] [2023-08-26 21:10:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:51,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:51,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:51,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:51,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:10:51,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:51,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:51,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:52,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 118#L818true, Black: 173#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:10:52,780 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 21:10:52,780 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:10:52,780 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:10:52,780 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:10:52,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][76], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), Black: 173#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 177#true, 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 46#P2EXITtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:10:52,867 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-26 21:10:52,867 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:10:52,867 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:10:52,867 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:10:52,989 INFO L124 PetriNetUnfolderBase]: 17221/24645 cut-off events. [2023-08-26 21:10:52,989 INFO L125 PetriNetUnfolderBase]: For 9733/10349 co-relation queries the response was YES. [2023-08-26 21:10:53,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64229 conditions, 24645 events. 17221/24645 cut-off events. For 9733/10349 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 158139 event pairs, 4918 based on Foata normal form. 21/22828 useless extension candidates. Maximal degree in co-relation 64218. Up to 9356 conditions per place. [2023-08-26 21:10:53,126 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 73 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-26 21:10:53,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 495 flow [2023-08-26 21:10:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-26 21:10:53,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028089887640449 [2023-08-26 21:10:53,128 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-26 21:10:53,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-26 21:10:53,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:53,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-26 21:10:53,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 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:10:53,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:53,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:53,131 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 181 flow. Second operand 4 states and 537 transitions. [2023-08-26 21:10:53,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 495 flow [2023-08-26 21:10:53,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:53,171 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 221 flow [2023-08-26 21:10:53,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-26 21:10:53,173 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-26 21:10:53,173 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 221 flow [2023-08-26 21:10:53,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:10:53,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:53,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:53,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:10:53,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:53,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1489098850, now seen corresponding path program 1 times [2023-08-26 21:10:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126447843] [2023-08-26 21:10:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:53,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:10:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126447843] [2023-08-26 21:10:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126447843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:10:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416442982] [2023-08-26 21:10:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:53,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:53,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:10:53,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:10:53,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:53,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:10:53,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:55,797 INFO L124 PetriNetUnfolderBase]: 22661/30848 cut-off events. [2023-08-26 21:10:55,797 INFO L125 PetriNetUnfolderBase]: For 24880/24880 co-relation queries the response was YES. [2023-08-26 21:10:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88528 conditions, 30848 events. 22661/30848 cut-off events. For 24880/24880 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 168759 event pairs, 4633 based on Foata normal form. 0/29514 useless extension candidates. Maximal degree in co-relation 88516. Up to 14948 conditions per place. [2023-08-26 21:10:55,917 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 100 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2023-08-26 21:10:55,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 109 transitions, 707 flow [2023-08-26 21:10:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-26 21:10:55,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803370786516854 [2023-08-26 21:10:55,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-26 21:10:55,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-26 21:10:55,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:55,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-26 21:10:55,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:10:55,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:55,922 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:55,922 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 221 flow. Second operand 4 states and 513 transitions. [2023-08-26 21:10:55,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 109 transitions, 707 flow [2023-08-26 21:10:55,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 661 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:55,936 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 271 flow [2023-08-26 21:10:55,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-26 21:10:55,937 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-26 21:10:55,937 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 271 flow [2023-08-26 21:10:55,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:10:55,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:55,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:55,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:10:55,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:55,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash 641116090, now seen corresponding path program 1 times [2023-08-26 21:10:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:55,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134821681] [2023-08-26 21:10:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:56,030 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:10:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134821681] [2023-08-26 21:10:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134821681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:56,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:56,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915398038] [2023-08-26 21:10:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:56,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:56,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:56,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 267 [2023-08-26 21:10:56,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:10:56,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:56,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 267 [2023-08-26 21:10:56,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:57,626 INFO L124 PetriNetUnfolderBase]: 16666/23701 cut-off events. [2023-08-26 21:10:57,626 INFO L125 PetriNetUnfolderBase]: For 19186/19825 co-relation queries the response was YES. [2023-08-26 21:10:57,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68382 conditions, 23701 events. 16666/23701 cut-off events. For 19186/19825 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 141584 event pairs, 5034 based on Foata normal form. 249/22837 useless extension candidates. Maximal degree in co-relation 68367. Up to 16022 conditions per place. [2023-08-26 21:10:57,743 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 65 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2023-08-26 21:10:57,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 515 flow [2023-08-26 21:10:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:10:57,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993757802746567 [2023-08-26 21:10:57,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:10:57,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:10:57,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:57,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:10:57,746 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:10:57,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:57,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:10:57,747 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 271 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:10:57,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 515 flow [2023-08-26 21:10:57,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:57,859 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 282 flow [2023-08-26 21:10:57,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-26 21:10:57,859 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2023-08-26 21:10:57,860 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 282 flow [2023-08-26 21:10:57,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:10:57,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:57,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:57,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:10:57,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:57,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1090093389, now seen corresponding path program 1 times [2023-08-26 21:10:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322985683] [2023-08-26 21:10:57,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:57,982 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:10:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322985683] [2023-08-26 21:10:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322985683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:57,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484717732] [2023-08-26 21:10:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:57,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:57,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:10:57,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:10:57,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:57,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:10:57,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:59,314 INFO L124 PetriNetUnfolderBase]: 12141/18269 cut-off events. [2023-08-26 21:10:59,314 INFO L125 PetriNetUnfolderBase]: For 11750/12592 co-relation queries the response was YES. [2023-08-26 21:10:59,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52125 conditions, 18269 events. 12141/18269 cut-off events. For 11750/12592 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 122081 event pairs, 1889 based on Foata normal form. 1333/18229 useless extension candidates. Maximal degree in co-relation 52108. Up to 9248 conditions per place. [2023-08-26 21:10:59,398 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 79 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2023-08-26 21:10:59,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 616 flow [2023-08-26 21:10:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 21:10:59,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-26 21:10:59,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 21:10:59,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 21:10:59,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:59,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 21:10:59,401 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:10:59,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:59,402 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:10:59,402 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 282 flow. Second operand 4 states and 520 transitions. [2023-08-26 21:10:59,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 616 flow [2023-08-26 21:10:59,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:59,438 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 304 flow [2023-08-26 21:10:59,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-26 21:10:59,438 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-26 21:10:59,438 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 304 flow [2023-08-26 21:10:59,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:10:59,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:59,439 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] [2023-08-26 21:10:59,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:10:59,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:59,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1630671125, now seen corresponding path program 1 times [2023-08-26 21:10:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:59,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736408562] [2023-08-26 21:10:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:59,549 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:10:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736408562] [2023-08-26 21:10:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736408562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:59,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:59,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014779684] [2023-08-26 21:10:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:59,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:59,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:59,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:59,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 267 [2023-08-26 21:10:59,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:10:59,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:59,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 267 [2023-08-26 21:10:59,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:01,819 INFO L124 PetriNetUnfolderBase]: 21059/30088 cut-off events. [2023-08-26 21:11:01,820 INFO L125 PetriNetUnfolderBase]: For 42865/42865 co-relation queries the response was YES. [2023-08-26 21:11:01,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100751 conditions, 30088 events. 21059/30088 cut-off events. For 42865/42865 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 182392 event pairs, 1061 based on Foata normal form. 253/29198 useless extension candidates. Maximal degree in co-relation 100732. Up to 13141 conditions per place. [2023-08-26 21:11:01,946 INFO L140 encePairwiseOnDemand]: 256/267 looper letters, 120 selfloop transitions, 28 changer transitions 0/148 dead transitions. [2023-08-26 21:11:01,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 148 transitions, 1074 flow [2023-08-26 21:11:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:11:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:11:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 21:11:01,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749063670411985 [2023-08-26 21:11:01,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 21:11:01,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 21:11:01,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:01,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 21:11:01,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 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:11:01,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:01,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:01,951 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 304 flow. Second operand 5 states and 634 transitions. [2023-08-26 21:11:01,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 148 transitions, 1074 flow [2023-08-26 21:11:02,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 148 transitions, 1054 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:11:02,062 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 510 flow [2023-08-26 21:11:02,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2023-08-26 21:11:02,063 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-26 21:11:02,063 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 510 flow [2023-08-26 21:11:02,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:11:02,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:02,063 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:11:02,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:11:02,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:02,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash -221274647, now seen corresponding path program 1 times [2023-08-26 21:11:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782824920] [2023-08-26 21:11:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:02,167 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:11:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782824920] [2023-08-26 21:11:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782824920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:11:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009981430] [2023-08-26 21:11:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:02,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:11:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:11:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:11:02,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:11:02,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 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:11:02,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:02,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:11:02,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:03,537 INFO L124 PetriNetUnfolderBase]: 11065/17492 cut-off events. [2023-08-26 21:11:03,537 INFO L125 PetriNetUnfolderBase]: For 25648/26397 co-relation queries the response was YES. [2023-08-26 21:11:03,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60152 conditions, 17492 events. 11065/17492 cut-off events. For 25648/26397 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 124260 event pairs, 1973 based on Foata normal form. 1119/17062 useless extension candidates. Maximal degree in co-relation 60130. Up to 5274 conditions per place. [2023-08-26 21:11:03,640 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 103 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2023-08-26 21:11:03,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 1052 flow [2023-08-26 21:11:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:11:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:11:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-26 21:11:03,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764044943820223 [2023-08-26 21:11:03,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-26 21:11:03,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-26 21:11:03,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:03,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-26 21:11:03,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 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:11:03,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:03,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:03,646 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 510 flow. Second operand 5 states and 651 transitions. [2023-08-26 21:11:03,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 1052 flow [2023-08-26 21:11:03,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 136 transitions, 1052 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:11:03,694 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 553 flow [2023-08-26 21:11:03,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-26 21:11:03,694 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-26 21:11:03,694 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 553 flow [2023-08-26 21:11:03,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 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:11:03,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:03,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:11:03,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:11:03,695 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:03,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1472975640, now seen corresponding path program 1 times [2023-08-26 21:11:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086565769] [2023-08-26 21:11:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:03,739 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:11:03,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086565769] [2023-08-26 21:11:03,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086565769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:03,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:03,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:11:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488618232] [2023-08-26 21:11:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:11:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:11:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:11:03,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:11:03,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:11:03,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:03,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:11:03,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:05,064 INFO L124 PetriNetUnfolderBase]: 9695/15117 cut-off events. [2023-08-26 21:11:05,064 INFO L125 PetriNetUnfolderBase]: For 36193/36882 co-relation queries the response was YES. [2023-08-26 21:11:05,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57321 conditions, 15117 events. 9695/15117 cut-off events. For 36193/36882 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 103528 event pairs, 1860 based on Foata normal form. 77/14747 useless extension candidates. Maximal degree in co-relation 57295. Up to 5274 conditions per place. [2023-08-26 21:11:05,144 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 104 selfloop transitions, 13 changer transitions 0/140 dead transitions. [2023-08-26 21:11:05,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 140 transitions, 1138 flow [2023-08-26 21:11:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:11:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:11:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-26 21:11:05,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49812734082397003 [2023-08-26 21:11:05,146 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-26 21:11:05,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-26 21:11:05,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:05,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-26 21:11:05,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 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:11:05,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:05,149 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:05,149 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 553 flow. Second operand 5 states and 665 transitions. [2023-08-26 21:11:05,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 140 transitions, 1138 flow [2023-08-26 21:11:05,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 140 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:11:05,201 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 612 flow [2023-08-26 21:11:05,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=612, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2023-08-26 21:11:05,201 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-26 21:11:05,202 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 612 flow [2023-08-26 21:11:05,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:11:05,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:05,202 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] [2023-08-26 21:11:05,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:11:05,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:05,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1985224468, now seen corresponding path program 1 times [2023-08-26 21:11:05,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486473287] [2023-08-26 21:11:05,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:05,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:05,360 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:11:05,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:05,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486473287] [2023-08-26 21:11:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486473287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:05,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:05,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:11:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18545574] [2023-08-26 21:11:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:05,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:11:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:11:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:11:05,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 267 [2023-08-26 21:11:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 612 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:11:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 267 [2023-08-26 21:11:05,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:08,137 INFO L124 PetriNetUnfolderBase]: 21562/31505 cut-off events. [2023-08-26 21:11:08,137 INFO L125 PetriNetUnfolderBase]: For 117538/117538 co-relation queries the response was YES. [2023-08-26 21:11:08,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136881 conditions, 31505 events. 21562/31505 cut-off events. For 117538/117538 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 200252 event pairs, 5308 based on Foata normal form. 61/31402 useless extension candidates. Maximal degree in co-relation 136854. Up to 11979 conditions per place. [2023-08-26 21:11:08,323 INFO L140 encePairwiseOnDemand]: 256/267 looper letters, 194 selfloop transitions, 43 changer transitions 0/237 dead transitions. [2023-08-26 21:11:08,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 237 transitions, 2271 flow [2023-08-26 21:11:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:11:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:11:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-26 21:11:08,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48002496878901374 [2023-08-26 21:11:08,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-26 21:11:08,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-26 21:11:08,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:08,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-26 21:11:08,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 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:11:08,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 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:11:08,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 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:11:08,329 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 612 flow. Second operand 6 states and 769 transitions. [2023-08-26 21:11:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 237 transitions, 2271 flow [2023-08-26 21:11:09,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 237 transitions, 2134 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-08-26 21:11:09,141 INFO L231 Difference]: Finished difference. Result has 79 places, 114 transitions, 1133 flow [2023-08-26 21:11:09,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1133, PETRI_PLACES=79, PETRI_TRANSITIONS=114} [2023-08-26 21:11:09,141 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-26 21:11:09,141 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 114 transitions, 1133 flow [2023-08-26 21:11:09,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:11:09,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:09,142 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:11:09,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:11:09,142 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:09,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -963539202, now seen corresponding path program 1 times [2023-08-26 21:11:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8228509] [2023-08-26 21:11:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:09,288 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:11:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8228509] [2023-08-26 21:11:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8228509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:11:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732233769] [2023-08-26 21:11:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:09,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:11:09,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:11:09,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:11:09,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:11:09,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 114 transitions, 1133 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:11:09,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:09,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:11:09,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:11,410 INFO L124 PetriNetUnfolderBase]: 13375/20874 cut-off events. [2023-08-26 21:11:11,411 INFO L125 PetriNetUnfolderBase]: For 56660/57749 co-relation queries the response was YES. [2023-08-26 21:11:11,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81685 conditions, 20874 events. 13375/20874 cut-off events. For 56660/57749 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 152017 event pairs, 2494 based on Foata normal form. 743/20821 useless extension candidates. Maximal degree in co-relation 81655. Up to 8076 conditions per place. [2023-08-26 21:11:11,545 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 142 selfloop transitions, 14 changer transitions 0/195 dead transitions. [2023-08-26 21:11:11,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 195 transitions, 1915 flow [2023-08-26 21:11:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:11:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:11:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-26 21:11:11,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-26 21:11:11,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-26 21:11:11,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-26 21:11:11,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:11,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-26 21:11:11,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 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:11:11,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 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:11:11,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 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:11:11,551 INFO L175 Difference]: Start difference. First operand has 79 places, 114 transitions, 1133 flow. Second operand 6 states and 780 transitions. [2023-08-26 21:11:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 195 transitions, 1915 flow [2023-08-26 21:11:12,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 195 transitions, 1915 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:11:12,713 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 1069 flow [2023-08-26 21:11:12,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1069, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2023-08-26 21:11:12,713 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-26 21:11:12,713 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 1069 flow [2023-08-26 21:11:12,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:11:12,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:12,714 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] [2023-08-26 21:11:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:11:12,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:12,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -474387344, now seen corresponding path program 1 times [2023-08-26 21:11:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682009357] [2023-08-26 21:11:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:12,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:12,836 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:11:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682009357] [2023-08-26 21:11:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682009357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:11:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103433944] [2023-08-26 21:11:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:11:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:11:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:11:12,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:11:12,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 1069 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:11:12,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:12,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:11:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:17,398 INFO L124 PetriNetUnfolderBase]: 32767/48452 cut-off events. [2023-08-26 21:11:17,399 INFO L125 PetriNetUnfolderBase]: For 237904/237904 co-relation queries the response was YES. [2023-08-26 21:11:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220253 conditions, 48452 events. 32767/48452 cut-off events. For 237904/237904 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 336674 event pairs, 8602 based on Foata normal form. 34/48104 useless extension candidates. Maximal degree in co-relation 220219. Up to 20415 conditions per place. [2023-08-26 21:11:17,717 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 187 selfloop transitions, 51 changer transitions 11/249 dead transitions. [2023-08-26 21:11:17,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 249 transitions, 2827 flow [2023-08-26 21:11:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:11:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:11:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-26 21:11:17,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49063670411985016 [2023-08-26 21:11:17,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-26 21:11:17,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-26 21:11:17,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:17,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-26 21:11:17,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:11:17,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:17,722 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:11:17,722 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 1069 flow. Second operand 5 states and 655 transitions. [2023-08-26 21:11:17,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 249 transitions, 2827 flow [2023-08-26 21:11:21,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 249 transitions, 2762 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:11:21,284 INFO L231 Difference]: Finished difference. Result has 90 places, 130 transitions, 1612 flow [2023-08-26 21:11:21,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1612, PETRI_PLACES=90, PETRI_TRANSITIONS=130} [2023-08-26 21:11:21,285 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2023-08-26 21:11:21,285 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 130 transitions, 1612 flow [2023-08-26 21:11:21,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:11:21,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:21,285 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] [2023-08-26 21:11:21,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:11:21,285 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:21,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1422312455, now seen corresponding path program 1 times [2023-08-26 21:11:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:21,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009132226] [2023-08-26 21:11:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:21,795 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:11:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009132226] [2023-08-26 21:11:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009132226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:11:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705070768] [2023-08-26 21:11:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:21,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:11:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:11:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:11:21,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-26 21:11:21,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 130 transitions, 1612 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 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:11:21,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:21,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-26 21:11:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:28,248 INFO L124 PetriNetUnfolderBase]: 36317/58290 cut-off events. [2023-08-26 21:11:28,248 INFO L125 PetriNetUnfolderBase]: For 223007/226491 co-relation queries the response was YES. [2023-08-26 21:11:28,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248910 conditions, 58290 events. 36317/58290 cut-off events. For 223007/226491 co-relation queries the response was YES. Maximal size of possible extension queue 3220. Compared 512162 event pairs, 6835 based on Foata normal form. 1260/57241 useless extension candidates. Maximal degree in co-relation 248872. Up to 24137 conditions per place. [2023-08-26 21:11:28,700 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 238 selfloop transitions, 15 changer transitions 11/314 dead transitions. [2023-08-26 21:11:28,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 314 transitions, 3841 flow [2023-08-26 21:11:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:11:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:11:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-26 21:11:28,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724451578384163 [2023-08-26 21:11:28,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-26 21:11:28,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-26 21:11:28,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:28,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-26 21:11:28,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 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:11:28,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:11:28,706 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:11:28,706 INFO L175 Difference]: Start difference. First operand has 90 places, 130 transitions, 1612 flow. Second operand 7 states and 883 transitions. [2023-08-26 21:11:28,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 314 transitions, 3841 flow [2023-08-26 21:11:36,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 314 transitions, 3839 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 21:11:36,959 INFO L231 Difference]: Finished difference. Result has 99 places, 145 transitions, 1819 flow [2023-08-26 21:11:36,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1819, PETRI_PLACES=99, PETRI_TRANSITIONS=145} [2023-08-26 21:11:36,959 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-26 21:11:36,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 145 transitions, 1819 flow [2023-08-26 21:11:36,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 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:11:36,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:36,960 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] [2023-08-26 21:11:36,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:11:36,960 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:36,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1342673907, now seen corresponding path program 2 times [2023-08-26 21:11:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808137103] [2023-08-26 21:11:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:37,103 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:11:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808137103] [2023-08-26 21:11:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808137103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:11:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444100454] [2023-08-26 21:11:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:37,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:11:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:37,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:11:37,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:11:37,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:11:37,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 145 transitions, 1819 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:11:37,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:37,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:11:37,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:42,969 INFO L124 PetriNetUnfolderBase]: 33907/53853 cut-off events. [2023-08-26 21:11:42,977 INFO L125 PetriNetUnfolderBase]: For 204212/207684 co-relation queries the response was YES. [2023-08-26 21:11:43,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239933 conditions, 53853 events. 33907/53853 cut-off events. For 204212/207684 co-relation queries the response was YES. Maximal size of possible extension queue 3207. Compared 469226 event pairs, 4209 based on Foata normal form. 1607/54079 useless extension candidates. Maximal degree in co-relation 239890. Up to 19710 conditions per place. [2023-08-26 21:11:43,316 INFO L140 encePairwiseOnDemand]: 256/267 looper letters, 74 selfloop transitions, 18 changer transitions 106/210 dead transitions. [2023-08-26 21:11:43,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 210 transitions, 2545 flow [2023-08-26 21:11:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:11:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:11:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-26 21:11:43,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923488496522203 [2023-08-26 21:11:43,319 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-26 21:11:43,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-26 21:11:43,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:43,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-26 21:11:43,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 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:11:43,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:11:43,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:11:43,323 INFO L175 Difference]: Start difference. First operand has 99 places, 145 transitions, 1819 flow. Second operand 7 states and 877 transitions. [2023-08-26 21:11:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 210 transitions, 2545 flow [2023-08-26 21:11:59,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 210 transitions, 2518 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 21:11:59,828 INFO L231 Difference]: Finished difference. Result has 100 places, 58 transitions, 539 flow [2023-08-26 21:11:59,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=539, PETRI_PLACES=100, PETRI_TRANSITIONS=58} [2023-08-26 21:11:59,828 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 48 predicate places. [2023-08-26 21:11:59,829 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 58 transitions, 539 flow [2023-08-26 21:11:59,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:11:59,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:59,829 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, 1] [2023-08-26 21:11:59,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:11:59,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:59,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash 881737687, now seen corresponding path program 1 times [2023-08-26 21:11:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856378215] [2023-08-26 21:11:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:00,308 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:12:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856378215] [2023-08-26 21:12:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856378215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:12:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581793065] [2023-08-26 21:12:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:12:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:12:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:12:00,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 267 [2023-08-26 21:12:00,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 58 transitions, 539 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 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:12:00,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:00,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 267 [2023-08-26 21:12:00,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:00,998 INFO L124 PetriNetUnfolderBase]: 3401/5571 cut-off events. [2023-08-26 21:12:00,998 INFO L125 PetriNetUnfolderBase]: For 29805/30338 co-relation queries the response was YES. [2023-08-26 21:12:01,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27236 conditions, 5571 events. 3401/5571 cut-off events. For 29805/30338 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 35569 event pairs, 783 based on Foata normal form. 119/5581 useless extension candidates. Maximal degree in co-relation 27196. Up to 2735 conditions per place. [2023-08-26 21:12:01,020 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 73 selfloop transitions, 5 changer transitions 42/132 dead transitions. [2023-08-26 21:12:01,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 132 transitions, 1392 flow [2023-08-26 21:12:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:12:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:12:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-08-26 21:12:01,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435527019796683 [2023-08-26 21:12:01,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-08-26 21:12:01,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-08-26 21:12:01,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:01,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-08-26 21:12:01,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 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:12:01,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:12:01,026 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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:12:01,026 INFO L175 Difference]: Start difference. First operand has 100 places, 58 transitions, 539 flow. Second operand 7 states and 829 transitions. [2023-08-26 21:12:01,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 132 transitions, 1392 flow [2023-08-26 21:12:01,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 1104 flow, removed 34 selfloop flow, removed 22 redundant places. [2023-08-26 21:12:01,188 INFO L231 Difference]: Finished difference. Result has 80 places, 58 transitions, 410 flow [2023-08-26 21:12:01,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=80, PETRI_TRANSITIONS=58} [2023-08-26 21:12:01,188 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-26 21:12:01,188 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 410 flow [2023-08-26 21:12:01,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 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:12:01,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:01,189 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, 1] [2023-08-26 21:12:01,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:12:01,189 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:01,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -187612105, now seen corresponding path program 2 times [2023-08-26 21:12:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78600066] [2023-08-26 21:12:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:01,301 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:12:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78600066] [2023-08-26 21:12:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78600066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:12:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460368356] [2023-08-26 21:12:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:01,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:12:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:12:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:12:01,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:12:01,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 58 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:12:01,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:01,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:12:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:01,846 INFO L124 PetriNetUnfolderBase]: 4139/6580 cut-off events. [2023-08-26 21:12:01,846 INFO L125 PetriNetUnfolderBase]: For 21874/21960 co-relation queries the response was YES. [2023-08-26 21:12:01,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27026 conditions, 6580 events. 4139/6580 cut-off events. For 21874/21960 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 39254 event pairs, 988 based on Foata normal form. 42/6598 useless extension candidates. Maximal degree in co-relation 27001. Up to 2934 conditions per place. [2023-08-26 21:12:01,866 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 45 selfloop transitions, 1 changer transitions 59/108 dead transitions. [2023-08-26 21:12:01,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 981 flow [2023-08-26 21:12:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:12:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:12:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-08-26 21:12:01,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47846441947565543 [2023-08-26 21:12:01,870 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-08-26 21:12:01,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-08-26 21:12:01,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:01,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-08-26 21:12:01,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:12:01,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:12:01,881 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:12:01,882 INFO L175 Difference]: Start difference. First operand has 80 places, 58 transitions, 410 flow. Second operand 4 states and 511 transitions. [2023-08-26 21:12:01,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 981 flow [2023-08-26 21:12:02,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 951 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 21:12:02,002 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 280 flow [2023-08-26 21:12:02,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2023-08-26 21:12:02,002 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2023-08-26 21:12:02,002 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 280 flow [2023-08-26 21:12:02,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:12:02,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:02,003 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, 1] [2023-08-26 21:12:02,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:12:02,003 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:02,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1906990543, now seen corresponding path program 3 times [2023-08-26 21:12:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263844399] [2023-08-26 21:12:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:12:02,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:12:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:12:02,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:12:02,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:12:02,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:12:02,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:12:02,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:12:02,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:12:02,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:12:02,104 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:02,108 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:12:02,108 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:12:02,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:12:02 BasicIcfg [2023-08-26 21:12:02,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:12:02,185 INFO L158 Benchmark]: Toolchain (without parser) took 83181.92ms. Allocated memory was 371.2MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 346.4MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-26 21:12:02,185 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 371.2MB. Free memory is still 348.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:12:02,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.18ms. Allocated memory is still 371.2MB. Free memory was 345.9MB in the beginning and 321.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:12:02,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 371.2MB. Free memory was 321.9MB in the beginning and 319.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:12:02,186 INFO L158 Benchmark]: Boogie Preprocessor took 19.35ms. Allocated memory is still 371.2MB. Free memory was 319.4MB in the beginning and 317.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:12:02,186 INFO L158 Benchmark]: RCFGBuilder took 503.62ms. Allocated memory is still 371.2MB. Free memory was 317.3MB in the beginning and 327.8MB in the end (delta: -10.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 21:12:02,186 INFO L158 Benchmark]: TraceAbstraction took 82154.38ms. Allocated memory was 371.2MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 326.7MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-26 21:12:02,187 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.11ms. Allocated memory is still 371.2MB. Free memory is still 348.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 445.18ms. Allocated memory is still 371.2MB. Free memory was 345.9MB in the beginning and 321.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 371.2MB. Free memory was 321.9MB in the beginning and 319.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.35ms. Allocated memory is still 371.2MB. Free memory was 319.4MB in the beginning and 317.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 503.62ms. Allocated memory is still 371.2MB. Free memory was 317.3MB in the beginning and 327.8MB in the end (delta: -10.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 82154.38ms. Allocated memory was 371.2MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 326.7MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.9GB. 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: 3.5s, 151 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 40 TransitionsAfterwards, 4682 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 18430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6623, independent: 6231, independent conditional: 0, independent unconditional: 6231, dependent: 392, dependent conditional: 0, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2550, independent: 2475, independent conditional: 0, independent unconditional: 2475, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6623, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 2550, unknown conditional: 0, unknown unconditional: 2550] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t177, ((void *)0), P0, ((void *)0))=-2, t177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t178, ((void *)0), P1, ((void *)0))=-1, t177={5:0}, t178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t179, ((void *)0), P2, ((void *)0))=0, t177={5:0}, t178={6:0}, t179={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t180, ((void *)0), P3, ((void *)0))=1, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L827] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=2, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=2, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=1, y=2, z=1] [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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", "mix007.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=1, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 878]: 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: 872]: 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: 876]: 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, 190 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: 82.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 75.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 962 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2167 IncrementalHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 45 mSDtfsCounter, 2167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1819occurred in iteration=15, InterpolantAutomatonStates: 84, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 1820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:12:02,206 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...