/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/safe028_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:19:27,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:19:27,855 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:19:27,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:19:27,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:19:27,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:19:27,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:19:27,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:19:27,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:19:27,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:19:27,891 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:19:27,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:19:27,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:19:27,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:19:27,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:19:27,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:19:27,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:19:27,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:19:27,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:19:27,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:19:27,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:19:27,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:19:27,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:19:27,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:19:27,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:19:27,900 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:19:27,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:19:27,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:27,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:19:27,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:19:27,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:19:27,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:19:27,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:19:27,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:19:27,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:19:27,902 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:19:28,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:19:28,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:19:28,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:19:28,221 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:19:28,221 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:19:28,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2023-08-27 10:19:29,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:19:29,700 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:19:29,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2023-08-27 10:19:29,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cee1059d/469cf1421d5b4f5bb0a00f610813bf53/FLAG3a8578205 [2023-08-27 10:19:29,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cee1059d/469cf1421d5b4f5bb0a00f610813bf53 [2023-08-27 10:19:29,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:19:29,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:19:29,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:29,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:19:29,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:19:29,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:29" (1/1) ... [2023-08-27 10:19:29,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556e284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:29, skipping insertion in model container [2023-08-27 10:19:29,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:29" (1/1) ... [2023-08-27 10:19:29,804 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:19:30,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:30,194 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:19:30,221 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:19:30,222 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:19:30,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:30,317 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:30,318 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:30,324 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:19:30,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30 WrapperNode [2023-08-27 10:19:30,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:30,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:30,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:19:30,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:19:30,331 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:19:30" (1/1) ... [2023-08-27 10:19:30,365 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:19:30" (1/1) ... [2023-08-27 10:19:30,399 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-27 10:19:30,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:30,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:19:30,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:19:30,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:19:30,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:19:30,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:19:30,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:19:30,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:19:30,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (1/1) ... [2023-08-27 10:19:30,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:30,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:19:30,464 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:19:30,480 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:19:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:19:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:19:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:19:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:19:30,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:19:30,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:19:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:19:30,507 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:19:30,627 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:19:30,628 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:19:31,022 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:19:31,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:19:31,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:19:31,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:31 BoogieIcfgContainer [2023-08-27 10:19:31,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:19:31,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:19:31,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:19:31,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:19:31,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:19:29" (1/3) ... [2023-08-27 10:19:31,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204e8589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:31, skipping insertion in model container [2023-08-27 10:19:31,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:30" (2/3) ... [2023-08-27 10:19:31,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204e8589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:31, skipping insertion in model container [2023-08-27 10:19:31,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:31" (3/3) ... [2023-08-27 10:19:31,232 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2023-08-27 10:19:31,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:19:31,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-27 10:19:31,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:19:31,329 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:19:31,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:19:31,457 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:19:31,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:31,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:19:31,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:19:31,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-27 10:19:31,474 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:19:31,482 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:19:31,484 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:19:31,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-27 10:19:31,509 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:19:31,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:19:31,512 INFO L119 LiptonReduction]: Number of co-enabled transitions 2402 [2023-08-27 10:19:36,877 INFO L134 LiptonReduction]: Checked pairs total: 8432 [2023-08-27 10:19:36,878 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-27 10:19:36,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:19:36,894 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;@75cddf5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:19:36,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-27 10:19:36,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:19:36,899 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:19:36,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:36,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:36,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:19:36,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:36,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 752121345, now seen corresponding path program 1 times [2023-08-27 10:19:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661840897] [2023-08-27 10:19:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:37,210 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:19:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661840897] [2023-08-27 10:19:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661840897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461238842] [2023-08-27 10:19:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:37,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:37,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-08-27 10:19:37,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:37,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-08-27 10:19:37,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:37,594 INFO L124 PetriNetUnfolderBase]: 1262/2011 cut-off events. [2023-08-27 10:19:37,594 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-27 10:19:37,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2011 events. 1262/2011 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9804 event pairs, 563 based on Foata normal form. 118/1467 useless extension candidates. Maximal degree in co-relation 4057. Up to 1814 conditions per place. [2023-08-27 10:19:37,612 INFO L140 encePairwiseOnDemand]: 241/253 looper letters, 37 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-27 10:19:37,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 181 flow [2023-08-27 10:19:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-27 10:19:37,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006587615283268 [2023-08-27 10:19:37,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-27 10:19:37,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-27 10:19:37,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:37,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-27 10:19:37,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:19:37,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states 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:19:37,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states 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:19:37,654 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 380 transitions. [2023-08-27 10:19:37,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 181 flow [2023-08-27 10:19:37,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:37,659 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 100 flow [2023-08-27 10:19:37,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 10:19:37,663 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:19:37,664 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 100 flow [2023-08-27 10:19:37,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:37,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:37,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:37,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:19:37,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:37,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1098907073, now seen corresponding path program 1 times [2023-08-27 10:19:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:37,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489971883] [2023-08-27 10:19:37,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:37,816 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:19:37,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489971883] [2023-08-27 10:19:37,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489971883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:37,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:37,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:37,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922804139] [2023-08-27 10:19:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:37,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:37,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-08-27 10:19:37,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:19:37,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:37,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-08-27 10:19:37,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:38,078 INFO L124 PetriNetUnfolderBase]: 889/1424 cut-off events. [2023-08-27 10:19:38,078 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-27 10:19:38,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3473 conditions, 1424 events. 889/1424 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6470 event pairs, 329 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 3462. Up to 1226 conditions per place. [2023-08-27 10:19:38,087 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 34 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-27 10:19:38,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 190 flow [2023-08-27 10:19:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-27 10:19:38,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475296442687747 [2023-08-27 10:19:38,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-27 10:19:38,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-27 10:19:38,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:38,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-27 10:19:38,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:38,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states 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:19:38,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states 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:19:38,099 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 100 flow. Second operand 4 states and 481 transitions. [2023-08-27 10:19:38,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 190 flow [2023-08-27 10:19:38,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:38,102 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 92 flow [2023-08-27 10:19:38,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-27 10:19:38,103 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-08-27 10:19:38,106 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 92 flow [2023-08-27 10:19:38,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:19:38,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:38,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:38,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:19:38,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:38,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1098907074, now seen corresponding path program 1 times [2023-08-27 10:19:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024858225] [2023-08-27 10:19:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:38,244 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:19:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024858225] [2023-08-27 10:19:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024858225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89994899] [2023-08-27 10:19:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:38,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:38,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:38,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:38,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-08-27 10:19:38,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:19:38,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:38,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-08-27 10:19:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:38,414 INFO L124 PetriNetUnfolderBase]: 342/591 cut-off events. [2023-08-27 10:19:38,414 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-08-27 10:19:38,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 591 events. 342/591 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2288 event pairs, 130 based on Foata normal form. 27/574 useless extension candidates. Maximal degree in co-relation 1440. Up to 205 conditions per place. [2023-08-27 10:19:38,418 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 43 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-27 10:19:38,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 250 flow [2023-08-27 10:19:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-27 10:19:38,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881422924901186 [2023-08-27 10:19:38,421 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-27 10:19:38,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-27 10:19:38,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:38,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-27 10:19:38,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:19:38,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states 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:19:38,425 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states 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:19:38,425 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 92 flow. Second operand 4 states and 494 transitions. [2023-08-27 10:19:38,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 250 flow [2023-08-27 10:19:38,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:38,427 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 133 flow [2023-08-27 10:19:38,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-27 10:19:38,429 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-27 10:19:38,429 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 133 flow [2023-08-27 10:19:38,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:19:38,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:38,430 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:19:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:19:38,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:38,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 379409128, now seen corresponding path program 1 times [2023-08-27 10:19:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604267589] [2023-08-27 10:19:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:38,599 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:19:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604267589] [2023-08-27 10:19:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604267589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545880228] [2023-08-27 10:19:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:38,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:38,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 253 [2023-08-27 10:19:38,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:38,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:38,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 253 [2023-08-27 10:19:38,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:38,775 INFO L124 PetriNetUnfolderBase]: 279/462 cut-off events. [2023-08-27 10:19:38,775 INFO L125 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2023-08-27 10:19:38,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 462 events. 279/462 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1702 event pairs, 110 based on Foata normal form. 9/460 useless extension candidates. Maximal degree in co-relation 1289. Up to 189 conditions per place. [2023-08-27 10:19:38,777 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 33 selfloop transitions, 10 changer transitions 5/49 dead transitions. [2023-08-27 10:19:38,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 259 flow [2023-08-27 10:19:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-27 10:19:38,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758893280632411 [2023-08-27 10:19:38,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-27 10:19:38,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-27 10:19:38,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:38,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-27 10:19:38,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:19:38,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states 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:19:38,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states 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:19:38,786 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 133 flow. Second operand 5 states and 602 transitions. [2023-08-27 10:19:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 259 flow [2023-08-27 10:19:38,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 245 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:38,790 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 125 flow [2023-08-27 10:19:38,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-27 10:19:38,791 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-27 10:19:38,791 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 125 flow [2023-08-27 10:19:38,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:38,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:38,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:38,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:19:38,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:38,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 359850197, now seen corresponding path program 1 times [2023-08-27 10:19:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374230890] [2023-08-27 10:19:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:39,137 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:19:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374230890] [2023-08-27 10:19:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374230890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:39,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:19:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186625589] [2023-08-27 10:19:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:39,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-08-27 10:19:39,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:39,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:39,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-08-27 10:19:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:39,311 INFO L124 PetriNetUnfolderBase]: 198/362 cut-off events. [2023-08-27 10:19:39,311 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2023-08-27 10:19:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 362 events. 198/362 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1410 event pairs, 18 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1118. Up to 223 conditions per place. [2023-08-27 10:19:39,313 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 32 selfloop transitions, 1 changer transitions 22/55 dead transitions. [2023-08-27 10:19:39,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 384 flow [2023-08-27 10:19:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-27 10:19:39,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46403162055335967 [2023-08-27 10:19:39,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-27 10:19:39,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-27 10:19:39,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:39,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-27 10:19:39,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:19:39,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states 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:19:39,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states 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:19:39,320 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 125 flow. Second operand 5 states and 587 transitions. [2023-08-27 10:19:39,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 384 flow [2023-08-27 10:19:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 328 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:39,323 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 108 flow [2023-08-27 10:19:39,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-27 10:19:39,324 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-27 10:19:39,324 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 108 flow [2023-08-27 10:19:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:39,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:39,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:19:39,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:39,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1672595845, now seen corresponding path program 2 times [2023-08-27 10:19:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529554610] [2023-08-27 10:19:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:41,626 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:19:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529554610] [2023-08-27 10:19:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529554610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:41,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:41,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:19:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616667019] [2023-08-27 10:19:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:41,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:19:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:19:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:19:41,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 253 [2023-08-27 10:19:41,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:19:41,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:41,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 253 [2023-08-27 10:19:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:42,037 INFO L124 PetriNetUnfolderBase]: 191/372 cut-off events. [2023-08-27 10:19:42,037 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2023-08-27 10:19:42,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 372 events. 191/372 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1445 event pairs, 96 based on Foata normal form. 1/371 useless extension candidates. Maximal degree in co-relation 1135. Up to 248 conditions per place. [2023-08-27 10:19:42,041 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 31 selfloop transitions, 7 changer transitions 13/52 dead transitions. [2023-08-27 10:19:42,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 333 flow [2023-08-27 10:19:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:19:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:19:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-08-27 10:19:42,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3959156785243742 [2023-08-27 10:19:42,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-08-27 10:19:42,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-08-27 10:19:42,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:42,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-08-27 10:19:42,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states 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:19:42,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:42,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:42,048 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 108 flow. Second operand 6 states and 601 transitions. [2023-08-27 10:19:42,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 333 flow [2023-08-27 10:19:42,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 325 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:42,053 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 144 flow [2023-08-27 10:19:42,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-27 10:19:42,055 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-27 10:19:42,058 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 144 flow [2023-08-27 10:19:42,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:19:42,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:42,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:19:42,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:42,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 378299641, now seen corresponding path program 3 times [2023-08-27 10:19:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780875752] [2023-08-27 10:19:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:44,117 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:19:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780875752] [2023-08-27 10:19:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780875752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:19:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089233802] [2023-08-27 10:19:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:44,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:19:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:19:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:19:44,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 253 [2023-08-27 10:19:44,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 144 flow. Second operand has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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:19:44,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:44,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 253 [2023-08-27 10:19:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:44,500 INFO L124 PetriNetUnfolderBase]: 216/433 cut-off events. [2023-08-27 10:19:44,500 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2023-08-27 10:19:44,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 433 events. 216/433 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1879 event pairs, 107 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 1541. Up to 231 conditions per place. [2023-08-27 10:19:44,502 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 30 selfloop transitions, 5 changer transitions 17/53 dead transitions. [2023-08-27 10:19:44,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 364 flow [2023-08-27 10:19:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:19:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:19:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-08-27 10:19:44,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2023-08-27 10:19:44,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-08-27 10:19:44,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-08-27 10:19:44,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:44,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-08-27 10:19:44,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:19:44,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:44,509 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:44,509 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 144 flow. Second operand 6 states and 583 transitions. [2023-08-27 10:19:44,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 364 flow [2023-08-27 10:19:44,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 361 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:44,512 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 148 flow [2023-08-27 10:19:44,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-08-27 10:19:44,513 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-27 10:19:44,513 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 148 flow [2023-08-27 10:19:44,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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:19:44,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:44,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:44,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:19:44,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:44,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1998478401, now seen corresponding path program 4 times [2023-08-27 10:19:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825308518] [2023-08-27 10:19:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:44,886 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:19:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825308518] [2023-08-27 10:19:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825308518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:19:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318371172] [2023-08-27 10:19:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:19:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:19:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:19:44,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 253 [2023-08-27 10:19:44,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:44,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:44,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 253 [2023-08-27 10:19:44,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:45,039 INFO L124 PetriNetUnfolderBase]: 112/239 cut-off events. [2023-08-27 10:19:45,039 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2023-08-27 10:19:45,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 239 events. 112/239 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 867 event pairs, 47 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 916. Up to 154 conditions per place. [2023-08-27 10:19:45,041 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 29 selfloop transitions, 5 changer transitions 21/56 dead transitions. [2023-08-27 10:19:45,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 405 flow [2023-08-27 10:19:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:19:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:19:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-08-27 10:19:45,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246188594014681 [2023-08-27 10:19:45,043 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-08-27 10:19:45,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-08-27 10:19:45,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:45,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-08-27 10:19:45,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:19:45,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states 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:19:45,050 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states 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:19:45,050 INFO L175 Difference]: Start difference. First operand has 49 places, 28 transitions, 148 flow. Second operand 7 states and 752 transitions. [2023-08-27 10:19:45,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 405 flow [2023-08-27 10:19:45,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 359 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-27 10:19:45,054 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 146 flow [2023-08-27 10:19:45,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-08-27 10:19:45,057 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-27 10:19:45,057 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 146 flow [2023-08-27 10:19:45,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:45,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:45,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:45,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:19:45,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:45,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1613448051, now seen corresponding path program 5 times [2023-08-27 10:19:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153222912] [2023-08-27 10:19:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:45,717 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:19:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:45,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153222912] [2023-08-27 10:19:45,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153222912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:45,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:45,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:19:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667363750] [2023-08-27 10:19:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:45,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:19:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:45,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:19:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:19:45,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 253 [2023-08-27 10:19:45,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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:19:45,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:45,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 253 [2023-08-27 10:19:45,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:45,938 INFO L124 PetriNetUnfolderBase]: 114/255 cut-off events. [2023-08-27 10:19:45,938 INFO L125 PetriNetUnfolderBase]: For 335/335 co-relation queries the response was YES. [2023-08-27 10:19:45,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 255 events. 114/255 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 996 event pairs, 28 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 990. Up to 121 conditions per place. [2023-08-27 10:19:45,940 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 36 selfloop transitions, 6 changer transitions 25/68 dead transitions. [2023-08-27 10:19:45,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 489 flow [2023-08-27 10:19:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:19:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:19:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions. [2023-08-27 10:19:45,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4184076792772445 [2023-08-27 10:19:45,942 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions. [2023-08-27 10:19:45,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions. [2023-08-27 10:19:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:45,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions. [2023-08-27 10:19:45,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:19:45,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states 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:19:45,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states 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:19:45,948 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 146 flow. Second operand 7 states and 741 transitions. [2023-08-27 10:19:45,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 489 flow [2023-08-27 10:19:45,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 469 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-27 10:19:45,952 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 169 flow [2023-08-27 10:19:45,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2023-08-27 10:19:45,952 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-27 10:19:45,953 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 169 flow [2023-08-27 10:19:45,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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:19:45,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:45,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:45,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:19:45,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:45,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -664409753, now seen corresponding path program 6 times [2023-08-27 10:19:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473896885] [2023-08-27 10:19:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:47,165 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:19:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473896885] [2023-08-27 10:19:47,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473896885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:47,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:19:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854159413] [2023-08-27 10:19:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:47,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:19:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:19:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:19:47,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 253 [2023-08-27 10:19:47,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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:19:47,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:47,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 253 [2023-08-27 10:19:47,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:47,427 INFO L124 PetriNetUnfolderBase]: 101/229 cut-off events. [2023-08-27 10:19:47,427 INFO L125 PetriNetUnfolderBase]: For 348/352 co-relation queries the response was YES. [2023-08-27 10:19:47,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 229 events. 101/229 cut-off events. For 348/352 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 847 event pairs, 23 based on Foata normal form. 5/232 useless extension candidates. Maximal degree in co-relation 908. Up to 141 conditions per place. [2023-08-27 10:19:47,428 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 31 selfloop transitions, 2 changer transitions 17/51 dead transitions. [2023-08-27 10:19:47,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 380 flow [2023-08-27 10:19:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:19:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:19:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2023-08-27 10:19:47,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044795783926219 [2023-08-27 10:19:47,431 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 614 transitions. [2023-08-27 10:19:47,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 614 transitions. [2023-08-27 10:19:47,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:47,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 614 transitions. [2023-08-27 10:19:47,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:19:47,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:47,435 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states 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:19:47,435 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 169 flow. Second operand 6 states and 614 transitions. [2023-08-27 10:19:47,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 380 flow [2023-08-27 10:19:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 361 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-27 10:19:47,439 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 147 flow [2023-08-27 10:19:47,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2023-08-27 10:19:47,440 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-27 10:19:47,440 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 147 flow [2023-08-27 10:19:47,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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:19:47,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:47,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:47,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:19:47,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:19:47,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1335008807, now seen corresponding path program 7 times [2023-08-27 10:19:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110583277] [2023-08-27 10:19:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:19:47,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:19:47,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:19:47,654 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:19:47,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-27 10:19:47,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-27 10:19:47,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-27 10:19:47,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-27 10:19:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-27 10:19:47,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-27 10:19:47,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-27 10:19:47,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:19:47,659 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2023-08-27 10:19:47,663 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:19:47,663 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:19:47,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:19:47 BasicIcfg [2023-08-27 10:19:47,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:19:47,769 INFO L158 Benchmark]: Toolchain (without parser) took 18023.86ms. Allocated memory was 354.4MB in the beginning and 675.3MB in the end (delta: 320.9MB). Free memory was 329.0MB in the beginning and 634.7MB in the end (delta: -305.7MB). Peak memory consumption was 404.2MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,769 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:19:47,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.17ms. Allocated memory is still 354.4MB. Free memory was 328.5MB in the beginning and 304.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.72ms. Allocated memory is still 354.4MB. Free memory was 304.3MB in the beginning and 301.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,770 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 354.4MB. Free memory was 301.7MB in the beginning and 299.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,770 INFO L158 Benchmark]: RCFGBuilder took 787.81ms. Allocated memory is still 354.4MB. Free memory was 299.6MB in the beginning and 279.3MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,770 INFO L158 Benchmark]: TraceAbstraction took 16542.52ms. Allocated memory was 354.4MB in the beginning and 675.3MB in the end (delta: 320.9MB). Free memory was 278.2MB in the beginning and 634.7MB in the end (delta: -356.5MB). Peak memory consumption was 351.8MB. Max. memory is 16.0GB. [2023-08-27 10:19:47,771 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.17ms. Allocated memory is still 354.4MB. Free memory was 328.5MB in the beginning and 304.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.72ms. Allocated memory is still 354.4MB. Free memory was 304.3MB in the beginning and 301.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 354.4MB. Free memory was 301.7MB in the beginning and 299.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 787.81ms. Allocated memory is still 354.4MB. Free memory was 299.6MB in the beginning and 279.3MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 16542.52ms. Allocated memory was 354.4MB in the beginning and 675.3MB in the end (delta: 320.9MB). Free memory was 278.2MB in the beginning and 634.7MB in the end (delta: -356.5MB). Peak memory consumption was 351.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 138 PlacesBefore, 38 PlacesAfterwards, 131 TransitionsBefore, 29 TransitionsAfterwards, 2402 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 8432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3096, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1243, independent: 1194, independent conditional: 0, independent unconditional: 1194, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3096, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 1243, unknown conditional: 0, unknown unconditional: 1243] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461, ((void *)0), P0, ((void *)0))=-2, t2461={7:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462, ((void *)0), P1, ((void *)0))=-1, t2461={7:0}, t2462={8:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L855] 0 pthread_t t2463; [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463, ((void *)0), P2, ((void *)0))=0, t2461={7:0}, t2462={8:0}, t2463={5:0}, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L784] EXPR 1 __unbuffered_cnt + 1 [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 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) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 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) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 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 [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L801] EXPR 2 __unbuffered_cnt + 1 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L836] EXPR 3 __unbuffered_cnt + 1 [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 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) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 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 [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461={7:0}, t2462={8:0}, t2463={5:0}, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] - UnprovableResult [Line: 784]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 163 locations, 16 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: 16.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1008 IncrementalHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 4 mSDtfsCounter, 1008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:19:47,804 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...