/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 PROGRAM_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/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:02:21,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:02:21,873 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 10:02:21,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:02:21,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:02:21,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:02:21,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:02:21,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:02:21,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:02:21,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:02:21,916 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:02:21,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:02:21,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:02:21,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:02:21,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:02:21,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:02:21,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:02:21,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:02:21,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:02:21,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:02:21,919 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:02:21,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:02:21,920 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:02:21,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:02:21,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:02:21,921 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:02:21,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:02:21,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:02:21,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:02:21,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:02:21,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:02:21,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:02:21,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:02:21,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:02:21,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:02:21,924 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 -> PROGRAM_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 10:02:22,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:02:22,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:02:22,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:02:22,294 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:02:22,294 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:02:22,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-08-27 10:02:23,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:02:23,739 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:02:23,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-08-27 10:02:23,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3f62f0f/88da115b76624c47aac6c5bf11d1d663/FLAG841abe9a4 [2023-08-27 10:02:23,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3f62f0f/88da115b76624c47aac6c5bf11d1d663 [2023-08-27 10:02:23,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:02:23,784 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:02:23,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:02:23,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:02:23,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:02:23,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:02:23" (1/1) ... [2023-08-27 10:02:23,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2cf2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:23, skipping insertion in model container [2023-08-27 10:02:23,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:02:23" (1/1) ... [2023-08-27 10:02:23,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:02:24,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:02:24,193 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:02:24,210 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:02:24,211 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:02:24,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:02:24,318 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:02:24,318 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:02:24,324 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:02:24,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24 WrapperNode [2023-08-27 10:02:24,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:02:24,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:02:24,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:02:24,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:02:24,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,418 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 276 [2023-08-27 10:02:24,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:02:24,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:02:24,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:02:24,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:02:24,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:02:24,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:02:24,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:02:24,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:02:24,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (1/1) ... [2023-08-27 10:02:24,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:02:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:02:24,518 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 10:02:24,538 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 10:02:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:02:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:02:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:02:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:02:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:02:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:02:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:02:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:02:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:02:24,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:02:24,560 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 10:02:24,733 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:02:24,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:02:25,120 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:02:25,324 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:02:25,324 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:02:25,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:02:25 BoogieIcfgContainer [2023-08-27 10:02:25,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:02:25,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:02:25,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:02:25,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:02:25,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:02:23" (1/3) ... [2023-08-27 10:02:25,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:02:25, skipping insertion in model container [2023-08-27 10:02:25,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:02:24" (2/3) ... [2023-08-27 10:02:25,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2d2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:02:25, skipping insertion in model container [2023-08-27 10:02:25,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:02:25" (3/3) ... [2023-08-27 10:02:25,335 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2023-08-27 10:02:25,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:02:25,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-27 10:02:25,352 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:02:25,432 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:02:25,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 164 transitions, 348 flow [2023-08-27 10:02:25,560 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-08-27 10:02:25,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:02:25,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-27 10:02:25,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 164 transitions, 348 flow [2023-08-27 10:02:25,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 160 transitions, 332 flow [2023-08-27 10:02:25,574 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:02:25,582 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 160 transitions, 332 flow [2023-08-27 10:02:25,585 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 160 transitions, 332 flow [2023-08-27 10:02:25,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 160 transitions, 332 flow [2023-08-27 10:02:25,619 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-08-27 10:02:25,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:02:25,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-27 10:02:25,623 INFO L119 LiptonReduction]: Number of co-enabled transitions 4824 [2023-08-27 10:02:31,482 INFO L134 LiptonReduction]: Checked pairs total: 19006 [2023-08-27 10:02:31,482 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-27 10:02:31,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:02:31,500 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;@454cf7fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:02:31,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-27 10:02:31,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:02:31,505 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 10:02:31,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:02:31,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:31,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:02:31,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:31,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 805974097, now seen corresponding path program 1 times [2023-08-27 10:02:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008671566] [2023-08-27 10:02:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:31,965 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 10:02:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008671566] [2023-08-27 10:02:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008671566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:31,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291270906] [2023-08-27 10:02:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:31,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:31,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:31,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 302 [2023-08-27 10:02:31,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 10:02:31,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:31,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 302 [2023-08-27 10:02:31,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:35,576 INFO L124 PetriNetUnfolderBase]: 20851/29326 cut-off events. [2023-08-27 10:02:35,577 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-08-27 10:02:35,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57486 conditions, 29326 events. 20851/29326 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 182260 event pairs, 7525 based on Foata normal form. 0/22350 useless extension candidates. Maximal degree in co-relation 57474. Up to 24517 conditions per place. [2023-08-27 10:02:35,777 INFO L140 encePairwiseOnDemand]: 298/302 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-27 10:02:35,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 250 flow [2023-08-27 10:02:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-08-27 10:02:35,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099337748344371 [2023-08-27 10:02:35,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-08-27 10:02:35,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-08-27 10:02:35,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:35,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-08-27 10:02:35,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 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 10:02:35,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:35,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:35,810 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 462 transitions. [2023-08-27 10:02:35,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 250 flow [2023-08-27 10:02:35,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 244 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:35,819 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2023-08-27 10:02:35,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-27 10:02:35,823 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-27 10:02:35,824 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 92 flow [2023-08-27 10:02:35,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 10:02:35,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:35,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:02:35,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:02:35,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:35,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash -786557766, now seen corresponding path program 1 times [2023-08-27 10:02:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342951880] [2023-08-27 10:02:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:35,891 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 10:02:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:35,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342951880] [2023-08-27 10:02:35,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342951880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:35,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:35,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:35,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672723855] [2023-08-27 10:02:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:35,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:35,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:35,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-08-27 10:02:35,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 92 flow. Second operand has 3 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 10:02:35,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:35,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-08-27 10:02:35,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:38,618 INFO L124 PetriNetUnfolderBase]: 20851/27954 cut-off events. [2023-08-27 10:02:38,618 INFO L125 PetriNetUnfolderBase]: For 967/967 co-relation queries the response was YES. [2023-08-27 10:02:38,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57082 conditions, 27954 events. 20851/27954 cut-off events. For 967/967 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 153448 event pairs, 20851 based on Foata normal form. 0/20628 useless extension candidates. Maximal degree in co-relation 57072. Up to 27652 conditions per place. [2023-08-27 10:02:38,780 INFO L140 encePairwiseOnDemand]: 297/302 looper letters, 31 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-27 10:02:38,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 148 flow [2023-08-27 10:02:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-27 10:02:38,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47019867549668876 [2023-08-27 10:02:38,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-27 10:02:38,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-27 10:02:38,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:38,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-27 10:02:38,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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 10:02:38,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:38,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:38,790 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 92 flow. Second operand 3 states and 426 transitions. [2023-08-27 10:02:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 148 flow [2023-08-27 10:02:38,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:38,793 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 82 flow [2023-08-27 10:02:38,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-27 10:02:38,794 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2023-08-27 10:02:38,795 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 82 flow [2023-08-27 10:02:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 10:02:38,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:38,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:02:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:02:38,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:38,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -786557765, now seen corresponding path program 1 times [2023-08-27 10:02:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256794751] [2023-08-27 10:02:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:38,838 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 10:02:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256794751] [2023-08-27 10:02:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256794751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788227083] [2023-08-27 10:02:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:38,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:38,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-08-27 10:02:38,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 82 flow. Second operand has 3 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 10:02:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:38,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-08-27 10:02:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:40,656 INFO L124 PetriNetUnfolderBase]: 13553/18548 cut-off events. [2023-08-27 10:02:40,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:02:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37328 conditions, 18548 events. 13553/18548 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 103115 event pairs, 4073 based on Foata normal form. 0/14728 useless extension candidates. Maximal degree in co-relation 37322. Up to 13929 conditions per place. [2023-08-27 10:02:40,746 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 53 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-27 10:02:40,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 256 flow [2023-08-27 10:02:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-27 10:02:40,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988962472406181 [2023-08-27 10:02:40,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-27 10:02:40,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-27 10:02:40,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:40,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-27 10:02:40,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 10:02:40,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:40,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:40,753 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 82 flow. Second operand 3 states and 452 transitions. [2023-08-27 10:02:40,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 256 flow [2023-08-27 10:02:40,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:40,755 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 120 flow [2023-08-27 10:02:40,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-27 10:02:40,755 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-27 10:02:40,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 120 flow [2023-08-27 10:02:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 10:02:40,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:40,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:02:40,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:40,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1447104996, now seen corresponding path program 1 times [2023-08-27 10:02:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222292843] [2023-08-27 10:02:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:40,850 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 10:02:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222292843] [2023-08-27 10:02:40,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222292843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:40,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:40,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118097246] [2023-08-27 10:02:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:40,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:40,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 302 [2023-08-27 10:02:40,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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 10:02:40,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:40,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 302 [2023-08-27 10:02:40,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:42,068 INFO L124 PetriNetUnfolderBase]: 11139/15616 cut-off events. [2023-08-27 10:02:42,069 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2023-08-27 10:02:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36980 conditions, 15616 events. 11139/15616 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 87531 event pairs, 2795 based on Foata normal form. 0/13057 useless extension candidates. Maximal degree in co-relation 36972. Up to 12643 conditions per place. [2023-08-27 10:02:42,171 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 57 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-27 10:02:42,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 307 flow [2023-08-27 10:02:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-27 10:02:42,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055187637969095 [2023-08-27 10:02:42,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-27 10:02:42,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-27 10:02:42,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:42,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-27 10:02:42,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:42,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:42,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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 10:02:42,178 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 120 flow. Second operand 3 states and 458 transitions. [2023-08-27 10:02:42,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 307 flow [2023-08-27 10:02:42,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:42,184 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 117 flow [2023-08-27 10:02:42,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-27 10:02:42,185 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-27 10:02:42,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 117 flow [2023-08-27 10:02:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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 10:02:42,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:42,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:42,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:02:42,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:42,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2077485966, now seen corresponding path program 1 times [2023-08-27 10:02:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432762848] [2023-08-27 10:02:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:42,770 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 10:02:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432762848] [2023-08-27 10:02:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432762848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646616092] [2023-08-27 10:02:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:42,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:42,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 302 [2023-08-27 10:02:42,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:42,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:42,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 302 [2023-08-27 10:02:42,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:46,182 INFO L124 PetriNetUnfolderBase]: 26863/36322 cut-off events. [2023-08-27 10:02:46,182 INFO L125 PetriNetUnfolderBase]: For 5270/5270 co-relation queries the response was YES. [2023-08-27 10:02:46,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83991 conditions, 36322 events. 26863/36322 cut-off events. For 5270/5270 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 192750 event pairs, 5837 based on Foata normal form. 0/32102 useless extension candidates. Maximal degree in co-relation 83982. Up to 21535 conditions per place. [2023-08-27 10:02:46,406 INFO L140 encePairwiseOnDemand]: 298/302 looper letters, 104 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2023-08-27 10:02:46,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 537 flow [2023-08-27 10:02:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-27 10:02:46,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543046357615894 [2023-08-27 10:02:46,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-27 10:02:46,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-27 10:02:46,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:46,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-27 10:02:46,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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 10:02:46,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:46,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:46,416 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 117 flow. Second operand 5 states and 686 transitions. [2023-08-27 10:02:46,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 537 flow [2023-08-27 10:02:46,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:46,431 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 137 flow [2023-08-27 10:02:46,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-27 10:02:46,433 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-08-27 10:02:46,433 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 137 flow [2023-08-27 10:02:46,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:46,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:46,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:46,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:02:46,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:46,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1428818065, now seen corresponding path program 1 times [2023-08-27 10:02:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470855955] [2023-08-27 10:02:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:46,521 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 10:02:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470855955] [2023-08-27 10:02:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470855955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:02:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783836589] [2023-08-27 10:02:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:46,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:46,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-08-27 10:02:46,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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 10:02:46,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:46,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-08-27 10:02:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:47,724 INFO L124 PetriNetUnfolderBase]: 9157/12797 cut-off events. [2023-08-27 10:02:47,724 INFO L125 PetriNetUnfolderBase]: For 2684/2699 co-relation queries the response was YES. [2023-08-27 10:02:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30584 conditions, 12797 events. 9157/12797 cut-off events. For 2684/2699 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 71504 event pairs, 2750 based on Foata normal form. 15/12098 useless extension candidates. Maximal degree in co-relation 30572. Up to 4879 conditions per place. [2023-08-27 10:02:47,835 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 73 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2023-08-27 10:02:47,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 431 flow [2023-08-27 10:02:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2023-08-27 10:02:47,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991721854304636 [2023-08-27 10:02:47,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2023-08-27 10:02:47,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2023-08-27 10:02:47,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:47,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2023-08-27 10:02:47,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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 10:02:47,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states 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 10:02:47,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states 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 10:02:47,842 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 137 flow. Second operand 4 states and 603 transitions. [2023-08-27 10:02:47,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 431 flow [2023-08-27 10:02:47,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:47,873 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 193 flow [2023-08-27 10:02:47,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-27 10:02:47,874 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-27 10:02:47,874 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 193 flow [2023-08-27 10:02:47,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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 10:02:47,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:47,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:47,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:02:47,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:47,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1442199950, now seen corresponding path program 1 times [2023-08-27 10:02:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733921637] [2023-08-27 10:02:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:48,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733921637] [2023-08-27 10:02:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733921637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:48,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:48,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049755082] [2023-08-27 10:02:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:48,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:48,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:48,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 302 [2023-08-27 10:02:48,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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 10:02:48,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:48,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 302 [2023-08-27 10:02:48,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:51,038 INFO L124 PetriNetUnfolderBase]: 25539/34724 cut-off events. [2023-08-27 10:02:51,038 INFO L125 PetriNetUnfolderBase]: For 28685/28685 co-relation queries the response was YES. [2023-08-27 10:02:51,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90887 conditions, 34724 events. 25539/34724 cut-off events. For 28685/28685 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 189712 event pairs, 5243 based on Foata normal form. 658/34596 useless extension candidates. Maximal degree in co-relation 90873. Up to 18970 conditions per place. [2023-08-27 10:02:51,243 INFO L140 encePairwiseOnDemand]: 298/302 looper letters, 124 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-08-27 10:02:51,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 129 transitions, 819 flow [2023-08-27 10:02:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-27 10:02:51,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45695364238410596 [2023-08-27 10:02:51,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-27 10:02:51,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-27 10:02:51,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:51,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-27 10:02:51,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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 10:02:51,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:51,250 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:51,250 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 193 flow. Second operand 5 states and 690 transitions. [2023-08-27 10:02:51,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 129 transitions, 819 flow [2023-08-27 10:02:51,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 761 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:51,365 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 213 flow [2023-08-27 10:02:51,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-27 10:02:51,366 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2023-08-27 10:02:51,366 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 213 flow [2023-08-27 10:02:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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 10:02:51,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:51,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:51,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:02:51,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:51,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1549446237, now seen corresponding path program 1 times [2023-08-27 10:02:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635505458] [2023-08-27 10:02:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:51,627 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 10:02:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635505458] [2023-08-27 10:02:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635505458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299029278] [2023-08-27 10:02:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:51,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:51,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:51,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 302 [2023-08-27 10:02:51,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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 10:02:51,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:51,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 302 [2023-08-27 10:02:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:52,701 INFO L124 PetriNetUnfolderBase]: 7654/11402 cut-off events. [2023-08-27 10:02:52,701 INFO L125 PetriNetUnfolderBase]: For 5802/5806 co-relation queries the response was YES. [2023-08-27 10:02:52,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30466 conditions, 11402 events. 7654/11402 cut-off events. For 5802/5806 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 69258 event pairs, 2015 based on Foata normal form. 440/10989 useless extension candidates. Maximal degree in co-relation 30449. Up to 9034 conditions per place. [2023-08-27 10:02:52,771 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 86 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-08-27 10:02:52,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 582 flow [2023-08-27 10:02:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2023-08-27 10:02:52,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48079470198675495 [2023-08-27 10:02:52,774 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2023-08-27 10:02:52,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2023-08-27 10:02:52,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:52,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2023-08-27 10:02:52,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 10:02:52,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:52,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:52,778 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 213 flow. Second operand 5 states and 726 transitions. [2023-08-27 10:02:52,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 582 flow [2023-08-27 10:02:52,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:52,810 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 278 flow [2023-08-27 10:02:52,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2023-08-27 10:02:52,811 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-08-27 10:02:52,811 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 278 flow [2023-08-27 10:02:52,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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 10:02:52,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:52,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:52,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:02:52,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:52,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 304269248, now seen corresponding path program 1 times [2023-08-27 10:02:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679322729] [2023-08-27 10:02:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:52,902 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 10:02:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679322729] [2023-08-27 10:02:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679322729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235763064] [2023-08-27 10:02:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:52,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:52,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:52,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-08-27 10:02:52,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 10:02:52,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:52,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-08-27 10:02:52,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:53,920 INFO L124 PetriNetUnfolderBase]: 6730/9885 cut-off events. [2023-08-27 10:02:53,920 INFO L125 PetriNetUnfolderBase]: For 7193/7194 co-relation queries the response was YES. [2023-08-27 10:02:53,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27141 conditions, 9885 events. 6730/9885 cut-off events. For 7193/7194 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 58851 event pairs, 1054 based on Foata normal form. 1/9631 useless extension candidates. Maximal degree in co-relation 27120. Up to 4566 conditions per place. [2023-08-27 10:02:53,974 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 94 selfloop transitions, 17 changer transitions 0/116 dead transitions. [2023-08-27 10:02:53,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 736 flow [2023-08-27 10:02:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 750 transitions. [2023-08-27 10:02:53,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966887417218543 [2023-08-27 10:02:53,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 750 transitions. [2023-08-27 10:02:53,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 750 transitions. [2023-08-27 10:02:53,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:53,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 750 transitions. [2023-08-27 10:02:53,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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 10:02:53,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:53,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states 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 10:02:53,981 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 278 flow. Second operand 5 states and 750 transitions. [2023-08-27 10:02:53,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 736 flow [2023-08-27 10:02:54,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:54,036 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 346 flow [2023-08-27 10:02:54,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2023-08-27 10:02:54,036 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-08-27 10:02:54,036 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 346 flow [2023-08-27 10:02:54,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 10:02:54,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:54,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:54,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:02:54,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:54,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash -966770309, now seen corresponding path program 1 times [2023-08-27 10:02:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420019293] [2023-08-27 10:02:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:54,376 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 10:02:54,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420019293] [2023-08-27 10:02:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420019293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:02:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919996857] [2023-08-27 10:02:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:54,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:54,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 302 [2023-08-27 10:02:54,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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 10:02:54,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:54,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 302 [2023-08-27 10:02:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:55,255 INFO L124 PetriNetUnfolderBase]: 3790/5817 cut-off events. [2023-08-27 10:02:55,255 INFO L125 PetriNetUnfolderBase]: For 7162/7162 co-relation queries the response was YES. [2023-08-27 10:02:55,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18089 conditions, 5817 events. 3790/5817 cut-off events. For 7162/7162 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 33085 event pairs, 686 based on Foata normal form. 253/5928 useless extension candidates. Maximal degree in co-relation 18067. Up to 1991 conditions per place. [2023-08-27 10:02:55,286 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 106 selfloop transitions, 19 changer transitions 4/134 dead transitions. [2023-08-27 10:02:55,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 876 flow [2023-08-27 10:02:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:02:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:02:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1015 transitions. [2023-08-27 10:02:55,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48013245033112584 [2023-08-27 10:02:55,289 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1015 transitions. [2023-08-27 10:02:55,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1015 transitions. [2023-08-27 10:02:55,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:55,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1015 transitions. [2023-08-27 10:02:55,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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 10:02:55,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:02:55,294 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:02:55,295 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 346 flow. Second operand 7 states and 1015 transitions. [2023-08-27 10:02:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 876 flow [2023-08-27 10:02:55,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 134 transitions, 810 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:02:55,356 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 398 flow [2023-08-27 10:02:55,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=398, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-27 10:02:55,357 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-27 10:02:55,357 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 398 flow [2023-08-27 10:02:55,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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 10:02:55,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:55,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:55,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:02:55,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:55,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 435809781, now seen corresponding path program 1 times [2023-08-27 10:02:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952318545] [2023-08-27 10:02:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:55,735 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 10:02:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952318545] [2023-08-27 10:02:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952318545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:55,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:02:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613936880] [2023-08-27 10:02:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:55,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:02:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:02:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:02:55,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 302 [2023-08-27 10:02:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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 10:02:55,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 302 [2023-08-27 10:02:55,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:56,456 INFO L124 PetriNetUnfolderBase]: 3059/4644 cut-off events. [2023-08-27 10:02:56,456 INFO L125 PetriNetUnfolderBase]: For 7559/7559 co-relation queries the response was YES. [2023-08-27 10:02:56,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15156 conditions, 4644 events. 3059/4644 cut-off events. For 7559/7559 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25202 event pairs, 517 based on Foata normal form. 91/4617 useless extension candidates. Maximal degree in co-relation 15131. Up to 1008 conditions per place. [2023-08-27 10:02:56,478 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 119 selfloop transitions, 28 changer transitions 4/156 dead transitions. [2023-08-27 10:02:56,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 966 flow [2023-08-27 10:02:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:02:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:02:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1302 transitions. [2023-08-27 10:02:56,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47902869757174393 [2023-08-27 10:02:56,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1302 transitions. [2023-08-27 10:02:56,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1302 transitions. [2023-08-27 10:02:56,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:56,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1302 transitions. [2023-08-27 10:02:56,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.66666666666666) internal successors, (1302), 9 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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 10:02:56,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states 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 10:02:56,488 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states 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 10:02:56,488 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 398 flow. Second operand 9 states and 1302 transitions. [2023-08-27 10:02:56,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 966 flow [2023-08-27 10:02:56,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 156 transitions, 932 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:56,593 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 460 flow [2023-08-27 10:02:56,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2023-08-27 10:02:56,594 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2023-08-27 10:02:56,594 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 460 flow [2023-08-27 10:02:56,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states 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 10:02:56,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:56,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:02:56,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:56,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2117512814, now seen corresponding path program 1 times [2023-08-27 10:02:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115830959] [2023-08-27 10:02:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:56,707 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 10:02:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115830959] [2023-08-27 10:02:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115830959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:02:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328668548] [2023-08-27 10:02:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:56,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:02:56,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:02:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:02:56,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-08-27 10:02:56,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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 10:02:56,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:56,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-08-27 10:02:56,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:57,369 INFO L124 PetriNetUnfolderBase]: 3037/4582 cut-off events. [2023-08-27 10:02:57,369 INFO L125 PetriNetUnfolderBase]: For 7570/7570 co-relation queries the response was YES. [2023-08-27 10:02:57,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15692 conditions, 4582 events. 3037/4582 cut-off events. For 7570/7570 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24803 event pairs, 866 based on Foata normal form. 0/4430 useless extension candidates. Maximal degree in co-relation 15664. Up to 1828 conditions per place. [2023-08-27 10:02:57,390 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 67 selfloop transitions, 17 changer transitions 21/109 dead transitions. [2023-08-27 10:02:57,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 778 flow [2023-08-27 10:02:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:02:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:02:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2023-08-27 10:02:57,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817880794701987 [2023-08-27 10:02:57,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 873 transitions. [2023-08-27 10:02:57,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 873 transitions. [2023-08-27 10:02:57,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:57,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 873 transitions. [2023-08-27 10:02:57,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states 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 10:02:57,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states 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 10:02:57,398 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states 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 10:02:57,398 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 460 flow. Second operand 6 states and 873 transitions. [2023-08-27 10:02:57,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 778 flow [2023-08-27 10:02:57,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 724 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 10:02:57,519 INFO L231 Difference]: Finished difference. Result has 79 places, 42 transitions, 252 flow [2023-08-27 10:02:57,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=79, PETRI_TRANSITIONS=42} [2023-08-27 10:02:57,520 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2023-08-27 10:02:57,520 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 42 transitions, 252 flow [2023-08-27 10:02:57,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states 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 10:02:57,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:57,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:57,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:02:57,521 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:57,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1290666887, now seen corresponding path program 1 times [2023-08-27 10:02:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366504217] [2023-08-27 10:02:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:58,051 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 10:02:58,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366504217] [2023-08-27 10:02:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366504217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:02:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222650173] [2023-08-27 10:02:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:58,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:02:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:02:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:02:58,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 302 [2023-08-27 10:02:58,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 42 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 10:02:58,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:58,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 302 [2023-08-27 10:02:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:58,828 INFO L124 PetriNetUnfolderBase]: 3720/5468 cut-off events. [2023-08-27 10:02:58,828 INFO L125 PetriNetUnfolderBase]: For 9821/9821 co-relation queries the response was YES. [2023-08-27 10:02:58,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16996 conditions, 5468 events. 3720/5468 cut-off events. For 9821/9821 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 26062 event pairs, 675 based on Foata normal form. 13/5481 useless extension candidates. Maximal degree in co-relation 16968. Up to 3472 conditions per place. [2023-08-27 10:02:58,853 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 87 selfloop transitions, 11 changer transitions 39/137 dead transitions. [2023-08-27 10:02:58,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 137 transitions, 1013 flow [2023-08-27 10:02:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:02:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:02:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-27 10:02:58,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43519394512771997 [2023-08-27 10:02:58,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-27 10:02:58,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-27 10:02:58,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:58,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-27 10:02:58,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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 10:02:58,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:02:58,860 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:02:58,860 INFO L175 Difference]: Start difference. First operand has 79 places, 42 transitions, 252 flow. Second operand 7 states and 920 transitions. [2023-08-27 10:02:58,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 137 transitions, 1013 flow [2023-08-27 10:02:58,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 137 transitions, 747 flow, removed 66 selfloop flow, removed 19 redundant places. [2023-08-27 10:02:58,915 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 236 flow [2023-08-27 10:02:58,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-27 10:02:58,916 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-08-27 10:02:58,916 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 236 flow [2023-08-27 10:02:58,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 10:02:58,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:58,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:02:58,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:02:58,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1288698581, now seen corresponding path program 2 times [2023-08-27 10:02:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:58,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138969366] [2023-08-27 10:02:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:03:00,667 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 10:03:00,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:03:00,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138969366] [2023-08-27 10:03:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138969366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:03:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:03:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 10:03:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267002963] [2023-08-27 10:03:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:03:00,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 10:03:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:03:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 10:03:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-27 10:03:00,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 302 [2023-08-27 10:03:00,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 236 flow. Second operand has 11 states, 11 states have (on average 126.18181818181819) internal successors, (1388), 11 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states 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 10:03:00,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:03:00,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 302 [2023-08-27 10:03:00,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:03:02,153 INFO L124 PetriNetUnfolderBase]: 4776/7462 cut-off events. [2023-08-27 10:03:02,153 INFO L125 PetriNetUnfolderBase]: For 6748/6776 co-relation queries the response was YES. [2023-08-27 10:03:02,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22572 conditions, 7462 events. 4776/7462 cut-off events. For 6748/6776 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 44437 event pairs, 334 based on Foata normal form. 16/7308 useless extension candidates. Maximal degree in co-relation 22554. Up to 1662 conditions per place. [2023-08-27 10:03:02,212 INFO L140 encePairwiseOnDemand]: 292/302 looper letters, 165 selfloop transitions, 16 changer transitions 46/235 dead transitions. [2023-08-27 10:03:02,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 235 transitions, 1471 flow [2023-08-27 10:03:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:03:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:03:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1517 transitions. [2023-08-27 10:03:02,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45665261890427455 [2023-08-27 10:03:02,216 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1517 transitions. [2023-08-27 10:03:02,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1517 transitions. [2023-08-27 10:03:02,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:03:02,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1517 transitions. [2023-08-27 10:03:02,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 137.9090909090909) internal successors, (1517), 11 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states 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 10:03:02,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states 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 10:03:02,224 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states 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 10:03:02,224 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 236 flow. Second operand 11 states and 1517 transitions. [2023-08-27 10:03:02,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 235 transitions, 1471 flow [2023-08-27 10:03:02,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 235 transitions, 1463 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-27 10:03:02,303 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 353 flow [2023-08-27 10:03:02,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-27 10:03:02,304 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-27 10:03:02,304 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 353 flow [2023-08-27 10:03:02,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 126.18181818181819) internal successors, (1388), 11 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states 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 10:03:02,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:03:02,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:03:02,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:03:02,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:03:02,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:03:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 445748631, now seen corresponding path program 3 times [2023-08-27 10:03:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:03:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354439131] [2023-08-27 10:03:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:03:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:03:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:03:02,637 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 10:03:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:03:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354439131] [2023-08-27 10:03:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354439131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:03:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:03:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:03:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482597926] [2023-08-27 10:03:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:03:02,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:03:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:03:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:03:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:03:02,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 302 [2023-08-27 10:03:02,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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 10:03:02,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:03:02,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 302 [2023-08-27 10:03:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:03:03,513 INFO L124 PetriNetUnfolderBase]: 4234/6573 cut-off events. [2023-08-27 10:03:03,513 INFO L125 PetriNetUnfolderBase]: For 13245/13303 co-relation queries the response was YES. [2023-08-27 10:03:03,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24332 conditions, 6573 events. 4234/6573 cut-off events. For 13245/13303 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 39514 event pairs, 691 based on Foata normal form. 80/6453 useless extension candidates. Maximal degree in co-relation 24304. Up to 2629 conditions per place. [2023-08-27 10:03:03,540 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 76 selfloop transitions, 17 changer transitions 39/139 dead transitions. [2023-08-27 10:03:03,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1001 flow [2023-08-27 10:03:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:03:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:03:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1121 transitions. [2023-08-27 10:03:03,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639900662251656 [2023-08-27 10:03:03,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1121 transitions. [2023-08-27 10:03:03,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1121 transitions. [2023-08-27 10:03:03,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:03:03,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1121 transitions. [2023-08-27 10:03:03,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states 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 10:03:03,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states 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 10:03:03,547 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states 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 10:03:03,547 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 353 flow. Second operand 8 states and 1121 transitions. [2023-08-27 10:03:03,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1001 flow [2023-08-27 10:03:03,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 970 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-27 10:03:03,682 INFO L231 Difference]: Finished difference. Result has 80 places, 52 transitions, 318 flow [2023-08-27 10:03:03,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=80, PETRI_TRANSITIONS=52} [2023-08-27 10:03:03,682 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2023-08-27 10:03:03,683 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 52 transitions, 318 flow [2023-08-27 10:03:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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 10:03:03,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:03:03,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:03:03,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:03:03,684 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:03:03,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:03:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 819968145, now seen corresponding path program 1 times [2023-08-27 10:03:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:03:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634783526] [2023-08-27 10:03:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:03:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:03:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:03:04,197 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 10:03:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:03:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634783526] [2023-08-27 10:03:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634783526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:03:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:03:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:03:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564656549] [2023-08-27 10:03:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:03:04,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:03:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:03:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:03:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:03:04,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 302 [2023-08-27 10:03:04,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 52 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 10:03:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:03:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 302 [2023-08-27 10:03:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:03:05,132 INFO L124 PetriNetUnfolderBase]: 4778/7217 cut-off events. [2023-08-27 10:03:05,132 INFO L125 PetriNetUnfolderBase]: For 18170/18170 co-relation queries the response was YES. [2023-08-27 10:03:05,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28473 conditions, 7217 events. 4778/7217 cut-off events. For 18170/18170 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 38954 event pairs, 1026 based on Foata normal form. 2/7219 useless extension candidates. Maximal degree in co-relation 28445. Up to 3099 conditions per place. [2023-08-27 10:03:05,166 INFO L140 encePairwiseOnDemand]: 295/302 looper letters, 65 selfloop transitions, 4 changer transitions 54/123 dead transitions. [2023-08-27 10:03:05,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 1012 flow [2023-08-27 10:03:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:03:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:03:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 886 transitions. [2023-08-27 10:03:05,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41911069063386946 [2023-08-27 10:03:05,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 886 transitions. [2023-08-27 10:03:05,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 886 transitions. [2023-08-27 10:03:05,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:03:05,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 886 transitions. [2023-08-27 10:03:05,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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 10:03:05,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:03:05,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states 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 10:03:05,171 INFO L175 Difference]: Start difference. First operand has 80 places, 52 transitions, 318 flow. Second operand 7 states and 886 transitions. [2023-08-27 10:03:05,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 1012 flow [2023-08-27 10:03:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 123 transitions, 890 flow, removed 19 selfloop flow, removed 10 redundant places. [2023-08-27 10:03:05,266 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 276 flow [2023-08-27 10:03:05,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-27 10:03:05,267 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2023-08-27 10:03:05,267 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 276 flow [2023-08-27 10:03:05,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 10:03:05,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:03:05,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:03:05,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:03:05,267 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 10:03:05,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:03:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash -418211769, now seen corresponding path program 2 times [2023-08-27 10:03:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:03:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340792430] [2023-08-27 10:03:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:03:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:03:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:03:05,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:03:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:03:05,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:03:05,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:03:05,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (24 of 25 remaining) [2023-08-27 10:03:05,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2023-08-27 10:03:05,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (21 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (18 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2023-08-27 10:03:05,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 25 remaining) [2023-08-27 10:03:05,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2023-08-27 10:03:05,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2023-08-27 10:03:05,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2023-08-27 10:03:05,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:03:05,512 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:03:05,517 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:03:05,517 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:03:05,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:03:05 BasicIcfg [2023-08-27 10:03:05,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:03:05,649 INFO L158 Benchmark]: Toolchain (without parser) took 41865.33ms. Allocated memory was 419.4MB in the beginning and 5.0GB in the end (delta: 4.6GB). Free memory was 394.2MB in the beginning and 3.9GB in the end (delta: -3.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-27 10:03:05,649 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 419.4MB. Free memory was 396.4MB in the beginning and 396.3MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:03:05,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.59ms. Allocated memory is still 419.4MB. Free memory was 394.2MB in the beginning and 366.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 10:03:05,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.97ms. Allocated memory is still 419.4MB. Free memory was 366.0MB in the beginning and 362.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:03:05,650 INFO L158 Benchmark]: Boogie Preprocessor took 66.86ms. Allocated memory is still 419.4MB. Free memory was 362.1MB in the beginning and 359.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:03:05,650 INFO L158 Benchmark]: RCFGBuilder took 839.92ms. Allocated memory is still 419.4MB. Free memory was 359.3MB in the beginning and 335.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.0GB. [2023-08-27 10:03:05,650 INFO L158 Benchmark]: TraceAbstraction took 40319.56ms. Allocated memory was 419.4MB in the beginning and 5.0GB in the end (delta: 4.6GB). Free memory was 334.7MB in the beginning and 3.9GB in the end (delta: -3.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-27 10:03:05,652 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.15ms. Allocated memory is still 419.4MB. Free memory was 396.4MB in the beginning and 396.3MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 540.59ms. Allocated memory is still 419.4MB. Free memory was 394.2MB in the beginning and 366.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 92.97ms. Allocated memory is still 419.4MB. Free memory was 366.0MB in the beginning and 362.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 66.86ms. Allocated memory is still 419.4MB. Free memory was 362.1MB in the beginning and 359.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 839.92ms. Allocated memory is still 419.4MB. Free memory was 359.3MB in the beginning and 335.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.0GB. * TraceAbstraction took 40319.56ms. Allocated memory was 419.4MB in the beginning and 5.0GB in the end (delta: 4.6GB). Free memory was 334.7MB in the beginning and 3.9GB in the end (delta: -3.5GB). Peak memory consumption was 1.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: 5.9s, 170 PlacesBefore, 54 PlacesAfterwards, 160 TransitionsBefore, 42 TransitionsAfterwards, 4824 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 138 TotalNumberOfCompositions, 19006 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6301, independent: 5911, independent conditional: 0, independent unconditional: 5911, dependent: 390, dependent conditional: 0, dependent unconditional: 390, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2488, independent: 2427, independent conditional: 0, independent unconditional: 2427, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6301, independent: 3484, independent conditional: 0, independent unconditional: 3484, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 2488, unknown conditional: 0, unknown unconditional: 2488] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=-3, t377={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=-2, t377={5:0}, t378={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=-1, t377={5:0}, t378={6:0}, t379={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L928] 0 pthread_t t380; [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L872] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=0] [L879] EXPR 3 __unbuffered_cnt + 1 [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L886] 4 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L775] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L837] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L785] EXPR 1 __unbuffered_cnt + 1 [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L907] EXPR 4 __unbuffered_cnt + 1 [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L844] EXPR 2 __unbuffered_cnt + 1 [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L940] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] 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", "mix014_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:52}, \read(__PRETTY_FUNCTION__)={50:51}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 907]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 907]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 923]: 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: 927]: 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: 929]: 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: 925]: 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, 210 locations, 25 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: 40.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 935 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 935 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2245 IncrementalHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 34 mSDtfsCounter, 2245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=11, InterpolantAutomatonStates: 91, 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.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 10:03:05,678 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...