/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:23:38,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:23:38,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:23:38,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:23:38,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:23:38,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:23:38,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:23:38,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:23:38,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:23:38,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:23:38,410 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:23:38,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:23:38,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:23:38,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:23:38,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:23:38,413 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:23:38,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:23:38,413 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:23:38,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:23:38,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:23:38,414 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:23:38,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:23:38,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:23:38,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:23:38,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:23:38,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:23:38,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:23:38,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:23:38,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:23:38,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:23:38,416 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:23:38,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:23:38,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:23:38,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:23:38,685 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:23:38,685 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:23:38,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 21:23:39,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:23:39,903 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:23:39,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 21:23:39,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f5723d4/966340aa4bd0433eb2f2d5a53a58cbd8/FLAG7ae0bc73d [2023-08-26 21:23:39,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f5723d4/966340aa4bd0433eb2f2d5a53a58cbd8 [2023-08-26 21:23:39,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:23:39,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:23:39,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:23:39,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:23:39,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:23:39,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:23:39" (1/1) ... [2023-08-26 21:23:39,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a49408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:39, skipping insertion in model container [2023-08-26 21:23:39,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:23:39" (1/1) ... [2023-08-26 21:23:39,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:23:40,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:23:40,265 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:23:40,289 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:23:40,290 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:23:40,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:23:40,361 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:23:40,361 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:23:40,366 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:23:40,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40 WrapperNode [2023-08-26 21:23:40,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:23:40,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:23:40,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:23:40,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:23:40,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,426 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-26 21:23:40,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:23:40,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:23:40,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:23:40,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:23:40,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:23:40,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:23:40,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:23:40,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:23:40,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (1/1) ... [2023-08-26 21:23:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:23:40,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:23:40,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:23:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:23:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:23:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:23:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:23:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:23:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:23:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:23:40,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:23:40,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:23:40,529 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:23:40,637 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:23:40,638 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:23:40,910 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:23:41,090 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:23:41,090 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:23:41,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:23:41 BoogieIcfgContainer [2023-08-26 21:23:41,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:23:41,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:23:41,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:23:41,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:23:41,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:23:39" (1/3) ... [2023-08-26 21:23:41,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a79f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:23:41, skipping insertion in model container [2023-08-26 21:23:41,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:23:40" (2/3) ... [2023-08-26 21:23:41,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a79f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:23:41, skipping insertion in model container [2023-08-26 21:23:41,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:23:41" (3/3) ... [2023-08-26 21:23:41,098 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2023-08-26 21:23:41,109 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:23:41,109 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-26 21:23:41,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:23:41,179 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:23:41,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-26 21:23:41,262 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-26 21:23:41,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:23:41,267 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 83 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:23:41,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-26 21:23:41,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-26 21:23:41,275 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:23:41,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-26 21:23:41,291 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-26 21:23:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-26 21:23:41,325 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-26 21:23:41,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:23:41,327 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 83 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:23:41,329 INFO L119 LiptonReduction]: Number of co-enabled transitions 2516 [2023-08-26 21:23:47,109 INFO L134 LiptonReduction]: Checked pairs total: 8976 [2023-08-26 21:23:47,110 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-26 21:23:47,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:23:47,122 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;@21323ed9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:23:47,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-26 21:23:47,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:23:47,125 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:23:47,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:23:47,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:47,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:23:47,126 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-26 21:23:47,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash 839026558, now seen corresponding path program 1 times [2023-08-26 21:23:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564670800] [2023-08-26 21:23:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:23:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564670800] [2023-08-26 21:23:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564670800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:47,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:47,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:23:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632280869] [2023-08-26 21:23:47,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:23:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:23:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:23:47,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:23:47,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:47,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:23:47,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:47,673 INFO L124 PetriNetUnfolderBase]: 1614/2405 cut-off events. [2023-08-26 21:23:47,673 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 21:23:47,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 2405 events. 1614/2405 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12276 event pairs, 1614 based on Foata normal form. 100/1789 useless extension candidates. Maximal degree in co-relation 4812. Up to 2363 conditions per place. [2023-08-26 21:23:47,688 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 22 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-26 21:23:47,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 107 flow [2023-08-26 21:23:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:23:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:23:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 21:23:47,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47410358565737054 [2023-08-26 21:23:47,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 21:23:47,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 21:23:47,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:47,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 21:23:47,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,712 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 357 transitions. [2023-08-26 21:23:47,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 107 flow [2023-08-26 21:23:47,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:23:47,717 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 60 flow [2023-08-26 21:23:47,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-26 21:23:47,722 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2023-08-26 21:23:47,722 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 60 flow [2023-08-26 21:23:47,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:47,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:23:47,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:23:47,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:23:47,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash 839026559, now seen corresponding path program 1 times [2023-08-26 21:23:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778601207] [2023-08-26 21:23:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:23:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778601207] [2023-08-26 21:23:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778601207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:47,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:47,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:23:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547959062] [2023-08-26 21:23:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:47,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:23:47,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:23:47,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:23:47,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:23:47,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:47,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:47,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:23:47,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:48,017 INFO L124 PetriNetUnfolderBase]: 718/1169 cut-off events. [2023-08-26 21:23:48,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:23:48,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1169 events. 718/1169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5749 event pairs, 269 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 2356. Up to 1036 conditions per place. [2023-08-26 21:23:48,022 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-26 21:23:48,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 162 flow [2023-08-26 21:23:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:23:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:23:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-26 21:23:48,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913678618857902 [2023-08-26 21:23:48,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-26 21:23:48,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-26 21:23:48,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:48,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-26 21:23:48,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,026 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 60 flow. Second operand 3 states and 370 transitions. [2023-08-26 21:23:48,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 162 flow [2023-08-26 21:23:48,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:23:48,027 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 91 flow [2023-08-26 21:23:48,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=59, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-26 21:23:48,028 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-26 21:23:48,028 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 91 flow [2023-08-26 21:23:48,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:48,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:48,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:23:48,028 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-26 21:23:48,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1938433628, now seen corresponding path program 1 times [2023-08-26 21:23:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608458149] [2023-08-26 21:23:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:23:48,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:48,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608458149] [2023-08-26 21:23:48,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608458149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:23:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288382125] [2023-08-26 21:23:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:23:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:23:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:23:48,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:23:48,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:48,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:23:48,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:48,211 INFO L124 PetriNetUnfolderBase]: 257/466 cut-off events. [2023-08-26 21:23:48,211 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-26 21:23:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 466 events. 257/466 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1884 event pairs, 85 based on Foata normal form. 21/451 useless extension candidates. Maximal degree in co-relation 1144. Up to 188 conditions per place. [2023-08-26 21:23:48,213 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 40 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2023-08-26 21:23:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 239 flow [2023-08-26 21:23:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:23:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:23:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-26 21:23:48,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48904382470119523 [2023-08-26 21:23:48,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-26 21:23:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-26 21:23:48,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:48,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-26 21:23:48,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,218 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 91 flow. Second operand 4 states and 491 transitions. [2023-08-26 21:23:48,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 239 flow [2023-08-26 21:23:48,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:23:48,219 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2023-08-26 21:23:48,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-26 21:23:48,219 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 21:23:48,220 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2023-08-26 21:23:48,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:48,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:48,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:23:48,220 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-26 21:23:48,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2061830201, now seen corresponding path program 1 times [2023-08-26 21:23:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592747641] [2023-08-26 21:23:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:23:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592747641] [2023-08-26 21:23:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592747641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:23:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980771369] [2023-08-26 21:23:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:48,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:23:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:23:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:23:48,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:23:48,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:48,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:23:48,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:48,431 INFO L124 PetriNetUnfolderBase]: 199/347 cut-off events. [2023-08-26 21:23:48,432 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2023-08-26 21:23:48,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 347 events. 199/347 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1301 event pairs, 65 based on Foata normal form. 8/351 useless extension candidates. Maximal degree in co-relation 938. Up to 145 conditions per place. [2023-08-26 21:23:48,433 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 30 selfloop transitions, 10 changer transitions 5/48 dead transitions. [2023-08-26 21:23:48,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 249 flow [2023-08-26 21:23:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:23:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:23:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-26 21:23:48,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47729083665338645 [2023-08-26 21:23:48,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-26 21:23:48,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-26 21:23:48,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:48,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-26 21:23:48,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,438 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 5 states and 599 transitions. [2023-08-26 21:23:48,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 249 flow [2023-08-26 21:23:48,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 235 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 21:23:48,440 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 125 flow [2023-08-26 21:23:48,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 21:23:48,441 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 21:23:48,441 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 125 flow [2023-08-26 21:23:48,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:48,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:48,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:23:48,442 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-26 21:23:48,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2040094786, now seen corresponding path program 1 times [2023-08-26 21:23:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108200841] [2023-08-26 21:23:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:23:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:23:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:23:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108200841] [2023-08-26 21:23:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108200841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:23:48,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:23:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:23:48,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936292376] [2023-08-26 21:23:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:23:48,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:23:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:23:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:23:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:23:48,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:23:48,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:48,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:23:48,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:23:48,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:23:49,035 INFO L124 PetriNetUnfolderBase]: 171/334 cut-off events. [2023-08-26 21:23:49,035 INFO L125 PetriNetUnfolderBase]: For 362/362 co-relation queries the response was YES. [2023-08-26 21:23:49,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 334 events. 171/334 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1479 event pairs, 79 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 985. Up to 197 conditions per place. [2023-08-26 21:23:49,037 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 33 selfloop transitions, 2 changer transitions 10/47 dead transitions. [2023-08-26 21:23:49,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 319 flow [2023-08-26 21:23:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:23:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:23:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-26 21:23:49,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721115537848606 [2023-08-26 21:23:49,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-26 21:23:49,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-26 21:23:49,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:23:49,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-26 21:23:49,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:49,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:49,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:49,041 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 125 flow. Second operand 4 states and 474 transitions. [2023-08-26 21:23:49,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 319 flow [2023-08-26 21:23:49,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 269 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 21:23:49,046 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 109 flow [2023-08-26 21:23:49,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 21:23:49,048 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 21:23:49,048 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 109 flow [2023-08-26 21:23:49,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:23:49,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:23:49,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:23:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:23:49,049 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-26 21:23:49,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:23:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -922814338, now seen corresponding path program 2 times [2023-08-26 21:23:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:23:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489378927] [2023-08-26 21:23:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:23:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:23:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:23:49,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:23:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:23:49,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:23:49,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:23:49,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-26 21:23:49,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-26 21:23:49,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-26 21:23:49,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-26 21:23:49,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-26 21:23:49,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-26 21:23:49,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-26 21:23:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-26 21:23:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-26 21:23:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-26 21:23:49,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-26 21:23:49,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:23:49,293 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-08-26 21:23:49,297 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:23:49,297 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:23:49,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:23:49 BasicIcfg [2023-08-26 21:23:49,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:23:49,376 INFO L158 Benchmark]: Toolchain (without parser) took 9448.99ms. Allocated memory was 364.9MB in the beginning and 555.7MB in the end (delta: 190.8MB). Free memory was 339.2MB in the beginning and 277.0MB in the end (delta: 62.2MB). Peak memory consumption was 251.9MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,377 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:23:49,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.97ms. Allocated memory is still 364.9MB. Free memory was 339.2MB in the beginning and 313.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 364.9MB. Free memory was 313.5MB in the beginning and 311.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,381 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 364.9MB. Free memory was 311.0MB in the beginning and 308.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,381 INFO L158 Benchmark]: RCFGBuilder took 620.93ms. Allocated memory is still 364.9MB. Free memory was 308.2MB in the beginning and 271.8MB in the end (delta: 36.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,381 INFO L158 Benchmark]: TraceAbstraction took 8279.60ms. Allocated memory was 364.9MB in the beginning and 555.7MB in the end (delta: 190.8MB). Free memory was 271.8MB in the beginning and 277.0MB in the end (delta: -5.1MB). Peak memory consumption was 184.6MB. Max. memory is 16.0GB. [2023-08-26 21:23:49,382 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.10ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.97ms. Allocated memory is still 364.9MB. Free memory was 339.2MB in the beginning and 313.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 364.9MB. Free memory was 313.5MB in the beginning and 311.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 364.9MB. Free memory was 311.0MB in the beginning and 308.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 620.93ms. Allocated memory is still 364.9MB. Free memory was 308.2MB in the beginning and 271.8MB in the end (delta: 36.4MB). Peak memory consumption was 35.8MB. Max. memory is 16.0GB. * TraceAbstraction took 8279.60ms. Allocated memory was 364.9MB in the beginning and 555.7MB in the end (delta: 190.8MB). Free memory was 271.8MB in the beginning and 277.0MB in the end (delta: -5.1MB). Peak memory consumption was 184.6MB. 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.8s, 138 PlacesBefore, 39 PlacesAfterwards, 131 TransitionsBefore, 30 TransitionsAfterwards, 2516 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 8976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3021, independent: 2741, independent conditional: 0, independent unconditional: 2741, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1347, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3021, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 1347, unknown conditional: 0, unknown unconditional: 1347] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1813; [L851] FCALL, FORK 0 pthread_create(&t1813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1813, ((void *)0), P0, ((void *)0))=-1, t1813={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 pthread_t t1814; [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] EXPR 1 \read(y) [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] FCALL, FORK 0 pthread_create(&t1814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1814, ((void *)0), P1, ((void *)0))=0, t1813={7:0}, t1814={5:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1815; [L855] FCALL, FORK 0 pthread_create(&t1815, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1815, ((void *)0), P2, ((void *)0))=1, t1813={7:0}, t1814={5:0}, t1815={8:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 y$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(y) [L812] 3 y$mem_tmp = y [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 \read(y) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L815] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L816] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L817] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L819] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L825] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L802] EXPR 2 __unbuffered_cnt + 1 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L835] EXPR 3 __unbuffered_cnt + 1 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1813={7:0}, t1814={5:0}, t1815={8:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 y$flush_delayed = weak$$choice2 [L871] EXPR 0 \read(y) [L871] 0 y$mem_tmp = y [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] EXPR 0 \read(y) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L874] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L875] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L876] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L878] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 x == 2 && y == 2 [L881] EXPR 0 \read(y) [L881] EXPR 0 x == 2 && y == 2 [L881] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] EXPR 0 \read(y) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] 0 y = y$flush_delayed ? y$mem_tmp : y [L883] 0 y$flush_delayed = (_Bool)0 [L885] 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", "safe001_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 851]: 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, 164 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: 8.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 19, 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.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:23:49,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...