/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:42:24,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:42:24,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:42:24,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:42:24,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:42:24,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:42:24,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:42:24,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:42:24,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:42:24,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:42:24,197 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:42:24,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:42:24,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:42:24,199 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:42:24,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:42:24,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:42:24,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:42:24,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:42:24,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:42:24,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:42:24,200 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:42:24,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:42:24,201 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:42:24,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:42:24,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:42:24,202 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:42:24,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:42:24,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:42:24,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:42:24,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:42:24,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:42:24,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:42:24,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:42:24,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:42:24,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:42:24,205 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:42:24,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:42:24,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:42:24,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:42:24,529 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:42:24,529 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:42:24,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-27 03:42:25,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:42:25,888 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:42:25,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-27 03:42:25,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a5e006ad/415d66cd6e054e74a0f7240c5192bd86/FLAGfbf220dd5 [2023-08-27 03:42:25,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a5e006ad/415d66cd6e054e74a0f7240c5192bd86 [2023-08-27 03:42:25,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:42:25,917 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:42:25,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:42:25,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:42:25,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:42:25,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:42:25" (1/1) ... [2023-08-27 03:42:25,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278f75e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:25, skipping insertion in model container [2023-08-27 03:42:25,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:42:25" (1/1) ... [2023-08-27 03:42:25,973 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:42:26,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:42:26,244 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:42:26,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:42:26,271 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:42:26,337 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:42:26,375 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:42:26,375 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:42:26,381 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:42:26,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26 WrapperNode [2023-08-27 03:42:26,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:42:26,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:42:26,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:42:26,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:42:26,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,460 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-27 03:42:26,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:42:26,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:42:26,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:42:26,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:42:26,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:42:26,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:42:26,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:42:26,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:42:26,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (1/1) ... [2023-08-27 03:42:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:42:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:42:26,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:42:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:42:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:42:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:42:26,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:42:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:42:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:42:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:42:26,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:42:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:42:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:42:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:42:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:42:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:42:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:42:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:42:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:42:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:42:26,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:42:26,611 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:42:26,765 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:42:26,767 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:42:27,185 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:42:27,336 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:42:27,337 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:42:27,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:42:27 BoogieIcfgContainer [2023-08-27 03:42:27,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:42:27,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:42:27,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:42:27,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:42:27,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:42:25" (1/3) ... [2023-08-27 03:42:27,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed40873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:42:27, skipping insertion in model container [2023-08-27 03:42:27,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:26" (2/3) ... [2023-08-27 03:42:27,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed40873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:42:27, skipping insertion in model container [2023-08-27 03:42:27,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:42:27" (3/3) ... [2023-08-27 03:42:27,348 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-08-27 03:42:27,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:42:27,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:42:27,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:42:27,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:42:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 03:42:27,550 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 03:42:27,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:27,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-27 03:42:27,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 03:42:27,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-27 03:42:27,566 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:42:27,581 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 03:42:27,584 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 03:42:27,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-27 03:42:27,638 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 03:42:27,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:27,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2023-08-27 03:42:27,643 INFO L119 LiptonReduction]: Number of co-enabled transitions 4540 [2023-08-27 03:42:31,843 INFO L134 LiptonReduction]: Checked pairs total: 17303 [2023-08-27 03:42:31,843 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-27 03:42:31,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:42:31,860 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;@19e059fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:42:31,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:42:31,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:42:31,864 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 03:42:31,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:31,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:31,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:42:31,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:31,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 625763, now seen corresponding path program 1 times [2023-08-27 03:42:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965976011] [2023-08-27 03:42:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965976011] [2023-08-27 03:42:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965976011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893959065] [2023-08-27 03:42:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:32,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:32,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 264 [2023-08-27 03:42:32,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:32,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:32,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 264 [2023-08-27 03:42:32,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:34,366 INFO L124 PetriNetUnfolderBase]: 12064/17240 cut-off events. [2023-08-27 03:42:34,367 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-27 03:42:34,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33683 conditions, 17240 events. 12064/17240 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 102731 event pairs, 6870 based on Foata normal form. 0/13402 useless extension candidates. Maximal degree in co-relation 33671. Up to 13549 conditions per place. [2023-08-27 03:42:34,509 INFO L140 encePairwiseOnDemand]: 260/264 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 03:42:34,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 245 flow [2023-08-27 03:42:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-27 03:42:34,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164141414141414 [2023-08-27 03:42:34,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-27 03:42:34,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-27 03:42:34,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:34,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-27 03:42:34,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:34,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:34,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:34,536 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 3 states and 409 transitions. [2023-08-27 03:42:34,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 245 flow [2023-08-27 03:42:34,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:42:34,545 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-27 03:42:34,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-27 03:42:34,549 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-27 03:42:34,549 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-27 03:42:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:34,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:34,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:42:34,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:42:34,550 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-27 03:42:34,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1462707065, now seen corresponding path program 1 times [2023-08-27 03:42:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420289328] [2023-08-27 03:42:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:34,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420289328] [2023-08-27 03:42:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420289328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:34,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567573405] [2023-08-27 03:42:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:34,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:34,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-27 03:42:34,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:34,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:34,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-27 03:42:34,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:36,434 INFO L124 PetriNetUnfolderBase]: 12064/16294 cut-off events. [2023-08-27 03:42:36,434 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-27 03:42:36,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33547 conditions, 16294 events. 12064/16294 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 86439 event pairs, 12064 based on Foata normal form. 0/12291 useless extension candidates. Maximal degree in co-relation 33537. Up to 16125 conditions per place. [2023-08-27 03:42:36,537 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-27 03:42:36,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 136 flow [2023-08-27 03:42:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-27 03:42:36,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2023-08-27 03:42:36,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-27 03:42:36,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-27 03:42:36,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:36,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-27 03:42:36,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:36,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:36,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:36,548 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 372 transitions. [2023-08-27 03:42:36,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 136 flow [2023-08-27 03:42:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:36,551 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-27 03:42:36,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 03:42:36,553 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-27 03:42:36,555 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-27 03:42:36,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:36,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:36,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:42:36,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:42:36,560 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-27 03:42:36,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1462707066, now seen corresponding path program 1 times [2023-08-27 03:42:36,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602906679] [2023-08-27 03:42:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602906679] [2023-08-27 03:42:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602906679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:36,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603941515] [2023-08-27 03:42:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:36,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:36,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:36,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-27 03:42:36,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:36,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:36,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-27 03:42:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:37,740 INFO L124 PetriNetUnfolderBase]: 7784/10762 cut-off events. [2023-08-27 03:42:37,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:37,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21683 conditions, 10762 events. 7784/10762 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 57897 event pairs, 2133 based on Foata normal form. 0/8754 useless extension candidates. Maximal degree in co-relation 21677. Up to 8563 conditions per place. [2023-08-27 03:42:37,793 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 03:42:37,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-27 03:42:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-27 03:42:37,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49873737373737376 [2023-08-27 03:42:37,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-27 03:42:37,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-27 03:42:37,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:37,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-27 03:42:37,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:37,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:37,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:37,799 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 395 transitions. [2023-08-27 03:42:37,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-27 03:42:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:37,801 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-27 03:42:37,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-27 03:42:37,803 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-27 03:42:37,803 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-27 03:42:37,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:37,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:37,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:42:37,808 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-27 03:42:37,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1206263635, now seen corresponding path program 1 times [2023-08-27 03:42:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534890329] [2023-08-27 03:42:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534890329] [2023-08-27 03:42:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534890329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:38,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509868008] [2023-08-27 03:42:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:38,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:38,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 264 [2023-08-27 03:42:38,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 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-27 03:42:38,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:38,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 264 [2023-08-27 03:42:38,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:40,706 INFO L124 PetriNetUnfolderBase]: 26759/36622 cut-off events. [2023-08-27 03:42:40,706 INFO L125 PetriNetUnfolderBase]: For 3417/3417 co-relation queries the response was YES. [2023-08-27 03:42:40,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86982 conditions, 36622 events. 26759/36622 cut-off events. For 3417/3417 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 208083 event pairs, 9736 based on Foata normal form. 0/31738 useless extension candidates. Maximal degree in co-relation 86974. Up to 22911 conditions per place. [2023-08-27 03:42:40,982 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 63 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-27 03:42:40,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 358 flow [2023-08-27 03:42:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-27 03:42:40,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-27 03:42:40,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-27 03:42:40,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-27 03:42:40,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:40,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-27 03:42:40,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:40,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:40,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:40,988 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 388 transitions. [2023-08-27 03:42:40,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 358 flow [2023-08-27 03:42:41,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:41,011 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 171 flow [2023-08-27 03:42:41,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-27 03:42:41,012 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-27 03:42:41,013 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 171 flow [2023-08-27 03:42:41,013 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-27 03:42:41,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:41,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:41,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:42:41,013 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-27 03:42:41,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -679672012, now seen corresponding path program 1 times [2023-08-27 03:42:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340573186] [2023-08-27 03:42:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340573186] [2023-08-27 03:42:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340573186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234910011] [2023-08-27 03:42:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:41,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-27 03:42:41,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:41,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-27 03:42:41,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:42,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][57], [162#(<= 0 ~__unbuffered_cnt~0), Black: 166#(= ~__unbuffered_cnt~0 0), 117#L813true, 43#P1EXITtrue, 54#L842true, Black: 171#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 4#ULTIMATE.startEXITtrue, 106#L766true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 169#true, P1Thread1of1ForFork0InUse, 178#(<= ~__unbuffered_cnt~0 1)]) [2023-08-27 03:42:42,614 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 03:42:42,614 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:42:42,614 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:42:42,614 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:42:42,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][76], [162#(<= 0 ~__unbuffered_cnt~0), Black: 166#(= ~__unbuffered_cnt~0 0), 43#P1EXITtrue, 54#L842true, Black: 171#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 4#ULTIMATE.startEXITtrue, 106#L766true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 175#true, 169#true, P1Thread1of1ForFork0InUse, 22#P2EXITtrue]) [2023-08-27 03:42:42,719 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-27 03:42:42,719 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:42:42,719 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:42:42,719 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:42:42,842 INFO L124 PetriNetUnfolderBase]: 15177/21599 cut-off events. [2023-08-27 03:42:42,842 INFO L125 PetriNetUnfolderBase]: For 8788/9255 co-relation queries the response was YES. [2023-08-27 03:42:42,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56422 conditions, 21599 events. 15177/21599 cut-off events. For 8788/9255 co-relation queries the response was YES. Maximal size of possible extension queue 1007. Compared 134177 event pairs, 4168 based on Foata normal form. 61/20381 useless extension candidates. Maximal degree in co-relation 56411. Up to 8233 conditions per place. [2023-08-27 03:42:42,994 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 73 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-08-27 03:42:42,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 485 flow [2023-08-27 03:42:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-27 03:42:42,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009469696969697 [2023-08-27 03:42:42,996 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-27 03:42:42,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-27 03:42:42,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:42,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-27 03:42:42,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,000 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,000 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 171 flow. Second operand 4 states and 529 transitions. [2023-08-27 03:42:43,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 485 flow [2023-08-27 03:42:43,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:43,039 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 213 flow [2023-08-27 03:42:43,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-27 03:42:43,040 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-27 03:42:43,040 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 213 flow [2023-08-27 03:42:43,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:43,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:43,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:42:43,041 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-27 03:42:43,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1795315683, now seen corresponding path program 1 times [2023-08-27 03:42:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532499753] [2023-08-27 03:42:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532499753] [2023-08-27 03:42:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532499753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583531214] [2023-08-27 03:42:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:43,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:43,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 264 [2023-08-27 03:42:43,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:43,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 264 [2023-08-27 03:42:43,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:44,625 INFO L124 PetriNetUnfolderBase]: 15194/21488 cut-off events. [2023-08-27 03:42:44,625 INFO L125 PetriNetUnfolderBase]: For 17232/17232 co-relation queries the response was YES. [2023-08-27 03:42:44,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60833 conditions, 21488 events. 15194/21488 cut-off events. For 17232/17232 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 124638 event pairs, 4607 based on Foata normal form. 0/20000 useless extension candidates. Maximal degree in co-relation 60821. Up to 14836 conditions per place. [2023-08-27 03:42:44,780 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 62 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-27 03:42:44,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 451 flow [2023-08-27 03:42:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-27 03:42:44,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49747474747474746 [2023-08-27 03:42:44,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-27 03:42:44,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-27 03:42:44,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:44,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-27 03:42:44,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,786 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 213 flow. Second operand 3 states and 394 transitions. [2023-08-27 03:42:44,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 451 flow [2023-08-27 03:42:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 421 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:44,798 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 206 flow [2023-08-27 03:42:44,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-27 03:42:44,798 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-27 03:42:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 206 flow [2023-08-27 03:42:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:44,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:42:44,799 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-27 03:42:44,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -423501499, now seen corresponding path program 1 times [2023-08-27 03:42:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442704661] [2023-08-27 03:42:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:44,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442704661] [2023-08-27 03:42:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442704661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148287836] [2023-08-27 03:42:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:44,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 264 [2023-08-27 03:42:44,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:44,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 264 [2023-08-27 03:42:44,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:47,139 INFO L124 PetriNetUnfolderBase]: 18494/25288 cut-off events. [2023-08-27 03:42:47,140 INFO L125 PetriNetUnfolderBase]: For 13616/13616 co-relation queries the response was YES. [2023-08-27 03:42:47,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71181 conditions, 25288 events. 18494/25288 cut-off events. For 13616/13616 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 136417 event pairs, 2431 based on Foata normal form. 40/24685 useless extension candidates. Maximal degree in co-relation 71168. Up to 15339 conditions per place. [2023-08-27 03:42:47,270 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 92 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2023-08-27 03:42:47,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 632 flow [2023-08-27 03:42:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-27 03:42:47,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48579545454545453 [2023-08-27 03:42:47,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-27 03:42:47,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-27 03:42:47,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:47,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-27 03:42:47,274 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-27 03:42:47,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,276 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 206 flow. Second operand 4 states and 513 transitions. [2023-08-27 03:42:47,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 632 flow [2023-08-27 03:42:47,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 104 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:47,289 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 295 flow [2023-08-27 03:42:47,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-27 03:42:47,290 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-27 03:42:47,290 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 295 flow [2023-08-27 03:42:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:47,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:42:47,291 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-27 03:42:47,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash -243594945, now seen corresponding path program 1 times [2023-08-27 03:42:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008422948] [2023-08-27 03:42:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008422948] [2023-08-27 03:42:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008422948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052654922] [2023-08-27 03:42:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:47,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:47,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:47,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:47,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-27 03:42:47,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:47,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-27 03:42:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:48,725 INFO L124 PetriNetUnfolderBase]: 11035/16537 cut-off events. [2023-08-27 03:42:48,725 INFO L125 PetriNetUnfolderBase]: For 13993/14644 co-relation queries the response was YES. [2023-08-27 03:42:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48765 conditions, 16537 events. 11035/16537 cut-off events. For 13993/14644 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 107526 event pairs, 1612 based on Foata normal form. 1282/16801 useless extension candidates. Maximal degree in co-relation 48749. Up to 8614 conditions per place. [2023-08-27 03:42:48,831 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 82 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2023-08-27 03:42:48,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 659 flow [2023-08-27 03:42:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-27 03:42:48,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-08-27 03:42:48,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-27 03:42:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-27 03:42:48,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:48,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-27 03:42:48,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,838 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,838 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 295 flow. Second operand 4 states and 512 transitions. [2023-08-27 03:42:48,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 659 flow [2023-08-27 03:42:48,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 659 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:42:48,876 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 325 flow [2023-08-27 03:42:48,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-27 03:42:48,877 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-27 03:42:48,877 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 325 flow [2023-08-27 03:42:48,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:48,878 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-27 03:42:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:42:48,878 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-27 03:42:48,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1796313962, now seen corresponding path program 1 times [2023-08-27 03:42:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636521183] [2023-08-27 03:42:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636521183] [2023-08-27 03:42:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636521183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:42:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771055907] [2023-08-27 03:42:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:49,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:49,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:49,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:49,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:49,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-27 03:42:49,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:49,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:49,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-27 03:42:49,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:50,174 INFO L124 PetriNetUnfolderBase]: 7967/12440 cut-off events. [2023-08-27 03:42:50,174 INFO L125 PetriNetUnfolderBase]: For 17394/17828 co-relation queries the response was YES. [2023-08-27 03:42:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40895 conditions, 12440 events. 7967/12440 cut-off events. For 17394/17828 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 82527 event pairs, 1557 based on Foata normal form. 915/12225 useless extension candidates. Maximal degree in co-relation 40875. Up to 3831 conditions per place. [2023-08-27 03:42:50,255 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 90 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-27 03:42:50,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 754 flow [2023-08-27 03:42:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:42:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:42:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-27 03:42:50,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4856060606060606 [2023-08-27 03:42:50,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-27 03:42:50,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-27 03:42:50,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:50,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-27 03:42:50,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:50,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:50,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:50,262 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 325 flow. Second operand 5 states and 641 transitions. [2023-08-27 03:42:50,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 754 flow [2023-08-27 03:42:50,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:50,283 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 355 flow [2023-08-27 03:42:50,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2023-08-27 03:42:50,284 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-27 03:42:50,284 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 355 flow [2023-08-27 03:42:50,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:50,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:50,285 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-27 03:42:50,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:42:50,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:50,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -309100145, now seen corresponding path program 1 times [2023-08-27 03:42:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251573130] [2023-08-27 03:42:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:50,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251573130] [2023-08-27 03:42:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251573130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393341172] [2023-08-27 03:42:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:50,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:50,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:50,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-27 03:42:50,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 355 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-27 03:42:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-27 03:42:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:51,336 INFO L124 PetriNetUnfolderBase]: 6987/10741 cut-off events. [2023-08-27 03:42:51,337 INFO L125 PetriNetUnfolderBase]: For 22318/22685 co-relation queries the response was YES. [2023-08-27 03:42:51,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38405 conditions, 10741 events. 6987/10741 cut-off events. For 22318/22685 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 68566 event pairs, 1477 based on Foata normal form. 145/10543 useless extension candidates. Maximal degree in co-relation 38383. Up to 3831 conditions per place. [2023-08-27 03:42:51,409 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 89 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2023-08-27 03:42:51,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 800 flow [2023-08-27 03:42:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:42:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:42:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-27 03:42:51,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-08-27 03:42:51,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-27 03:42:51,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-27 03:42:51,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:51,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-27 03:42:51,413 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-27 03:42:51,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,416 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 355 flow. Second operand 5 states and 655 transitions. [2023-08-27 03:42:51,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 800 flow [2023-08-27 03:42:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 784 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:42:51,443 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 414 flow [2023-08-27 03:42:51,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-27 03:42:51,443 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-27 03:42:51,443 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 414 flow [2023-08-27 03:42:51,444 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-27 03:42:51,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:51,444 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-27 03:42:51,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:42:51,444 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:51,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1590830658, now seen corresponding path program 1 times [2023-08-27 03:42:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429232088] [2023-08-27 03:42:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429232088] [2023-08-27 03:42:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429232088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:51,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:51,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325517956] [2023-08-27 03:42:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:51,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:51,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-08-27 03:42:51,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:51,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-08-27 03:42:51,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:53,101 INFO L124 PetriNetUnfolderBase]: 12029/18092 cut-off events. [2023-08-27 03:42:53,102 INFO L125 PetriNetUnfolderBase]: For 50524/50824 co-relation queries the response was YES. [2023-08-27 03:42:53,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69785 conditions, 18092 events. 12029/18092 cut-off events. For 50524/50824 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 116858 event pairs, 1870 based on Foata normal form. 276/18213 useless extension candidates. Maximal degree in co-relation 69762. Up to 9110 conditions per place. [2023-08-27 03:42:53,233 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 113 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2023-08-27 03:42:53,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 1093 flow [2023-08-27 03:42:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-27 03:42:53,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2023-08-27 03:42:53,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-27 03:42:53,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-27 03:42:53,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:53,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-27 03:42:53,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,240 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 414 flow. Second operand 4 states and 516 transitions. [2023-08-27 03:42:53,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 1093 flow [2023-08-27 03:42:53,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 1003 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-27 03:42:53,510 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 409 flow [2023-08-27 03:42:53,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-27 03:42:53,510 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-27 03:42:53,510 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 409 flow [2023-08-27 03:42:53,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:53,511 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-27 03:42:53,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:42:53,511 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-27 03:42:53,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1760563427, now seen corresponding path program 1 times [2023-08-27 03:42:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301655948] [2023-08-27 03:42:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301655948] [2023-08-27 03:42:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301655948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093388404] [2023-08-27 03:42:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:53,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 264 [2023-08-27 03:42:53,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:53,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 264 [2023-08-27 03:42:53,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:55,728 INFO L124 PetriNetUnfolderBase]: 14658/22815 cut-off events. [2023-08-27 03:42:55,728 INFO L125 PetriNetUnfolderBase]: For 46360/46866 co-relation queries the response was YES. [2023-08-27 03:42:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82203 conditions, 22815 events. 14658/22815 cut-off events. For 46360/46866 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 163512 event pairs, 5249 based on Foata normal form. 259/22344 useless extension candidates. Maximal degree in co-relation 82179. Up to 12332 conditions per place. [2023-08-27 03:42:55,882 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 84 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2023-08-27 03:42:55,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 818 flow [2023-08-27 03:42:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-27 03:42:55,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2023-08-27 03:42:55,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-27 03:42:55,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-27 03:42:55,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:55,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-27 03:42:55,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,886 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 409 flow. Second operand 3 states and 399 transitions. [2023-08-27 03:42:55,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 818 flow [2023-08-27 03:42:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:56,271 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 428 flow [2023-08-27 03:42:56,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-27 03:42:56,272 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-27 03:42:56,272 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 428 flow [2023-08-27 03:42:56,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:56,272 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-27 03:42:56,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:42:56,272 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-27 03:42:56,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -954963052, now seen corresponding path program 1 times [2023-08-27 03:42:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131120091] [2023-08-27 03:42:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131120091] [2023-08-27 03:42:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131120091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:42:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8156305] [2023-08-27 03:42:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:42:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:42:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:42:56,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-27 03:42:56,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:56,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-27 03:42:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:58,289 INFO L124 PetriNetUnfolderBase]: 11728/18269 cut-off events. [2023-08-27 03:42:58,289 INFO L125 PetriNetUnfolderBase]: For 35380/36033 co-relation queries the response was YES. [2023-08-27 03:42:58,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65955 conditions, 18269 events. 11728/18269 cut-off events. For 35380/36033 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 131742 event pairs, 2411 based on Foata normal form. 711/18254 useless extension candidates. Maximal degree in co-relation 65930. Up to 7173 conditions per place. [2023-08-27 03:42:58,454 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 101 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2023-08-27 03:42:58,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 129 transitions, 966 flow [2023-08-27 03:42:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:42:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:42:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2023-08-27 03:42:58,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-08-27 03:42:58,456 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2023-08-27 03:42:58,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2023-08-27 03:42:58,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:58,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2023-08-27 03:42:58,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:58,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:58,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:58,459 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 428 flow. Second operand 6 states and 768 transitions. [2023-08-27 03:42:58,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 129 transitions, 966 flow [2023-08-27 03:42:59,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 921 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:59,254 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 456 flow [2023-08-27 03:42:59,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-08-27 03:42:59,255 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-27 03:42:59,255 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 456 flow [2023-08-27 03:42:59,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:59,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:59,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:59,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:42:59,255 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-27 03:42:59,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -959561293, now seen corresponding path program 1 times [2023-08-27 03:42:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136671459] [2023-08-27 03:42:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:42:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136671459] [2023-08-27 03:42:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136671459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:42:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267035049] [2023-08-27 03:42:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:59,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:42:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:42:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:42:59,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 264 [2023-08-27 03:42:59,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:59,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:59,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 264 [2023-08-27 03:42:59,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:03,381 INFO L124 PetriNetUnfolderBase]: 24784/37372 cut-off events. [2023-08-27 03:43:03,381 INFO L125 PetriNetUnfolderBase]: For 142824/142824 co-relation queries the response was YES. [2023-08-27 03:43:03,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158150 conditions, 37372 events. 24784/37372 cut-off events. For 142824/142824 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 266199 event pairs, 2725 based on Foata normal form. 15/36942 useless extension candidates. Maximal degree in co-relation 158123. Up to 11456 conditions per place. [2023-08-27 03:43:03,682 INFO L140 encePairwiseOnDemand]: 251/264 looper letters, 210 selfloop transitions, 49 changer transitions 7/266 dead transitions. [2023-08-27 03:43:03,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 266 transitions, 2452 flow [2023-08-27 03:43:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:43:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:43:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 963 transitions. [2023-08-27 03:43:03,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559659090909091 [2023-08-27 03:43:03,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 963 transitions. [2023-08-27 03:43:03,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 963 transitions. [2023-08-27 03:43:03,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:03,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 963 transitions. [2023-08-27 03:43:03,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:03,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:03,690 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:03,690 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 456 flow. Second operand 8 states and 963 transitions. [2023-08-27 03:43:03,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 266 transitions, 2452 flow [2023-08-27 03:43:07,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 266 transitions, 2328 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 03:43:07,096 INFO L231 Difference]: Finished difference. Result has 84 places, 105 transitions, 965 flow [2023-08-27 03:43:07,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=965, PETRI_PLACES=84, PETRI_TRANSITIONS=105} [2023-08-27 03:43:07,097 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-27 03:43:07,098 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 105 transitions, 965 flow [2023-08-27 03:43:07,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:07,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:07,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:43:07,099 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-27 03:43:07,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -385044257, now seen corresponding path program 2 times [2023-08-27 03:43:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932932767] [2023-08-27 03:43:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:43:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932932767] [2023-08-27 03:43:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932932767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:43:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768022341] [2023-08-27 03:43:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:07,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:43:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:43:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:43:07,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 264 [2023-08-27 03:43:07,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 105 transitions, 965 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-27 03:43:07,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:07,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 264 [2023-08-27 03:43:07,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:11,034 INFO L124 PetriNetUnfolderBase]: 18996/29947 cut-off events. [2023-08-27 03:43:11,034 INFO L125 PetriNetUnfolderBase]: For 100496/102720 co-relation queries the response was YES. [2023-08-27 03:43:11,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129248 conditions, 29947 events. 18996/29947 cut-off events. For 100496/102720 co-relation queries the response was YES. Maximal size of possible extension queue 1719. Compared 237386 event pairs, 2408 based on Foata normal form. 1280/30474 useless extension candidates. Maximal degree in co-relation 129216. Up to 11486 conditions per place. [2023-08-27 03:43:11,227 INFO L140 encePairwiseOnDemand]: 253/264 looper letters, 83 selfloop transitions, 18 changer transitions 65/181 dead transitions. [2023-08-27 03:43:11,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 181 transitions, 1714 flow [2023-08-27 03:43:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:43:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:43:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-08-27 03:43:11,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466991341991342 [2023-08-27 03:43:11,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-08-27 03:43:11,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-08-27 03:43:11,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:11,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-08-27 03:43:11,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:11,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:11,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:11,234 INFO L175 Difference]: Start difference. First operand has 84 places, 105 transitions, 965 flow. Second operand 7 states and 863 transitions. [2023-08-27 03:43:11,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 181 transitions, 1714 flow [2023-08-27 03:43:15,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 181 transitions, 1690 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 03:43:15,554 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 577 flow [2023-08-27 03:43:15,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2023-08-27 03:43:15,554 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-27 03:43:15,555 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 577 flow [2023-08-27 03:43:15,555 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-27 03:43:15,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:15,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:15,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:43:15,555 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-27 03:43:15,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash 684078010, now seen corresponding path program 1 times [2023-08-27 03:43:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891686292] [2023-08-27 03:43:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:43:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891686292] [2023-08-27 03:43:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891686292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:43:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733538355] [2023-08-27 03:43:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:16,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:43:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:43:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:43:16,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 264 [2023-08-27 03:43:16,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:16,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 264 [2023-08-27 03:43:16,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:17,713 INFO L124 PetriNetUnfolderBase]: 7339/12026 cut-off events. [2023-08-27 03:43:17,713 INFO L125 PetriNetUnfolderBase]: For 60016/60324 co-relation queries the response was YES. [2023-08-27 03:43:17,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58710 conditions, 12026 events. 7339/12026 cut-off events. For 60016/60324 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 85800 event pairs, 1338 based on Foata normal form. 84/11921 useless extension candidates. Maximal degree in co-relation 58677. Up to 4001 conditions per place. [2023-08-27 03:43:17,783 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 99 selfloop transitions, 9 changer transitions 61/178 dead transitions. [2023-08-27 03:43:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 178 transitions, 1916 flow [2023-08-27 03:43:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:43:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:43:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-08-27 03:43:17,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-08-27 03:43:17,785 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-08-27 03:43:17,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-08-27 03:43:17,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:17,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-08-27 03:43:17,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:17,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:17,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:17,790 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 577 flow. Second operand 7 states and 833 transitions. [2023-08-27 03:43:17,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 178 transitions, 1916 flow [2023-08-27 03:43:18,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 178 transitions, 1554 flow, removed 61 selfloop flow, removed 12 redundant places. [2023-08-27 03:43:18,513 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 489 flow [2023-08-27 03:43:18,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2023-08-27 03:43:18,513 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-27 03:43:18,513 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 489 flow [2023-08-27 03:43:18,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:18,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:18,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:43:18,514 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-27 03:43:18,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1684302066, now seen corresponding path program 2 times [2023-08-27 03:43:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814222245] [2023-08-27 03:43:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:43:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814222245] [2023-08-27 03:43:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814222245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:18,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:18,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:43:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390969763] [2023-08-27 03:43:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:18,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:43:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:43:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:43:18,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 264 [2023-08-27 03:43:18,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:18,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 264 [2023-08-27 03:43:18,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:19,700 INFO L124 PetriNetUnfolderBase]: 6390/10397 cut-off events. [2023-08-27 03:43:19,701 INFO L125 PetriNetUnfolderBase]: For 32761/32983 co-relation queries the response was YES. [2023-08-27 03:43:19,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43439 conditions, 10397 events. 6390/10397 cut-off events. For 32761/32983 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 69075 event pairs, 1976 based on Foata normal form. 30/10316 useless extension candidates. Maximal degree in co-relation 43414. Up to 5697 conditions per place. [2023-08-27 03:43:19,758 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 51 selfloop transitions, 1 changer transitions 67/123 dead transitions. [2023-08-27 03:43:19,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 1144 flow [2023-08-27 03:43:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:43:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:43:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-27 03:43:19,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-08-27 03:43:19,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-27 03:43:19,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-27 03:43:19,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:19,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-27 03:43:19,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:19,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:19,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:19,763 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 489 flow. Second operand 4 states and 512 transitions. [2023-08-27 03:43:19,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 1144 flow [2023-08-27 03:43:20,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 123 transitions, 1112 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-27 03:43:20,085 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 355 flow [2023-08-27 03:43:20,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=77, PETRI_TRANSITIONS=50} [2023-08-27 03:43:20,086 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-27 03:43:20,086 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 355 flow [2023-08-27 03:43:20,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:20,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:43:20,087 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-27 03:43:20,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 983939422, now seen corresponding path program 3 times [2023-08-27 03:43:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329397581] [2023-08-27 03:43:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:43:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329397581] [2023-08-27 03:43:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329397581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:43:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272563359] [2023-08-27 03:43:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:21,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:43:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:43:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:43:21,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 264 [2023-08-27 03:43:21,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 50 transitions, 355 flow. Second operand has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:21,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:21,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 264 [2023-08-27 03:43:21,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:21,396 INFO L124 PetriNetUnfolderBase]: 969/1656 cut-off events. [2023-08-27 03:43:21,397 INFO L125 PetriNetUnfolderBase]: For 4950/4987 co-relation queries the response was YES. [2023-08-27 03:43:21,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 1656 events. 969/1656 cut-off events. For 4950/4987 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8161 event pairs, 277 based on Foata normal form. 16/1648 useless extension candidates. Maximal degree in co-relation 7000. Up to 824 conditions per place. [2023-08-27 03:43:21,405 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 75 selfloop transitions, 6 changer transitions 35/120 dead transitions. [2023-08-27 03:43:21,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 120 transitions, 1028 flow [2023-08-27 03:43:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:43:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:43:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2023-08-27 03:43:21,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-27 03:43:21,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2023-08-27 03:43:21,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2023-08-27 03:43:21,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:21,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2023-08-27 03:43:21,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:21,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:21,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:21,413 INFO L175 Difference]: Start difference. First operand has 77 places, 50 transitions, 355 flow. Second operand 6 states and 720 transitions. [2023-08-27 03:43:21,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 120 transitions, 1028 flow [2023-08-27 03:43:21,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 720 flow, removed 39 selfloop flow, removed 18 redundant places. [2023-08-27 03:43:21,439 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 247 flow [2023-08-27 03:43:21,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-08-27 03:43:21,440 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-27 03:43:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 247 flow [2023-08-27 03:43:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:21,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:21,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:43:21,440 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-27 03:43:21,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1237151640, now seen corresponding path program 4 times [2023-08-27 03:43:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646475659] [2023-08-27 03:43:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:43:21,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:43:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:43:21,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:43:21,621 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:43:21,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:43:21,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 03:43:21,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:43:21,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:43:21,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:43:21,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:43:21,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:43:21,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:43:21,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:43:21,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:43:21,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:43:21,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:43:21,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:43:21,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:43:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:43:21,629 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:21,635 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:43:21,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:43:21,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:43:21 BasicIcfg [2023-08-27 03:43:21,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:43:21,732 INFO L158 Benchmark]: Toolchain (without parser) took 55815.24ms. Allocated memory was 354.4MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 329.1MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-27 03:43:21,732 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 330.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:43:21,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.12ms. Allocated memory is still 354.4MB. Free memory was 328.7MB in the beginning and 304.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:43:21,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.04ms. Allocated memory is still 354.4MB. Free memory was 304.6MB in the beginning and 302.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:43:21,733 INFO L158 Benchmark]: Boogie Preprocessor took 54.94ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 300.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:43:21,733 INFO L158 Benchmark]: RCFGBuilder took 822.65ms. Allocated memory is still 354.4MB. Free memory was 299.7MB in the beginning and 309.8MB in the end (delta: -10.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:43:21,733 INFO L158 Benchmark]: TraceAbstraction took 54390.18ms. Allocated memory was 354.4MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 308.9MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-27 03:43:21,735 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 330.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 464.12ms. Allocated memory is still 354.4MB. Free memory was 328.7MB in the beginning and 304.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.04ms. Allocated memory is still 354.4MB. Free memory was 304.6MB in the beginning and 302.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.94ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 300.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 822.65ms. Allocated memory is still 354.4MB. Free memory was 299.7MB in the beginning and 309.8MB in the end (delta: -10.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 54390.18ms. Allocated memory was 354.4MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 308.9MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 149 PlacesBefore, 51 PlacesAfterwards, 139 TransitionsBefore, 39 TransitionsAfterwards, 4540 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, 17303 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6338, independent: 5963, independent conditional: 0, independent unconditional: 5963, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2504, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6338, independent: 3533, independent conditional: 0, independent unconditional: 3533, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 2504, unknown conditional: 0, unknown unconditional: 2504] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, 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_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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(&t521, ((void *)0), P0, ((void *)0))=-2, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=-1, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=0, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t524, ((void *)0), P3, ((void *)0))=1, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 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) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=1, y=2, z=1] [L844] 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) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 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 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=1, y=2, z=1] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=1, y=2, z=1] [L775] EXPR 1 __unbuffered_cnt + 1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L795] EXPR 2 __unbuffered_cnt + 1 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L815] EXPR 3 __unbuffered_cnt + 1 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] EXPR 4 __unbuffered_cnt + 1 [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 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=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, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 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 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 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=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, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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", "mix020.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=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=0, 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: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 867]: 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: 873]: 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: 869]: 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, 187 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: 54.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 869 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2064 IncrementalHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 29 mSDtfsCounter, 2064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=14, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 2218 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-27 03:43:21,762 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...