/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:36:11,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:36:11,972 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-24 05:36:11,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:36:11,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:36:12,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:36:12,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:36:12,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:36:12,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:36:12,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:36:12,016 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:36:12,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:36:12,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:36:12,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:36:12,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:36:12,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:36:12,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:36:12,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:36:12,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:36:12,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:36:12,019 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:36:12,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:36:12,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:36:12,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:36:12,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:36:12,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:36:12,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:36:12,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:12,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:36:12,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:36:12,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:36:12,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:36:12,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:36:12,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:36:12,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:36:12,023 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:36:12,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:36:12,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:36:12,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:36:12,347 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:36:12,348 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:36:12,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2023-08-24 05:36:13,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:36:13,770 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:36:13,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2023-08-24 05:36:13,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f80ea8b3/02002f0605024004b7f02e0173a9bc9d/FLAG3385f7750 [2023-08-24 05:36:14,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f80ea8b3/02002f0605024004b7f02e0173a9bc9d [2023-08-24 05:36:14,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:36:14,074 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:36:14,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:14,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:36:14,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:36:14,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70111916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14, skipping insertion in model container [2023-08-24 05:36:14,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:36:14,254 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i[990,1003] [2023-08-24 05:36:14,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:14,410 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:36:14,419 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i[990,1003] [2023-08-24 05:36:14,427 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:14,428 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:14,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:14,536 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:14,536 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:14,542 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:36:14,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14 WrapperNode [2023-08-24 05:36:14,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:14,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:14,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:36:14,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:36:14,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,628 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2023-08-24 05:36:14,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:14,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:36:14,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:36:14,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:36:14,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:36:14,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:36:14,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:36:14,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:36:14,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (1/1) ... [2023-08-24 05:36:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:36:14,733 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-24 05:36:14,753 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-24 05:36:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 05:36:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:36:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:36:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:36:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:36:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:36:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:36:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:36:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:36:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:36:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:36:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:36:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:36:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:36:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:36:14,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:36:14,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:36:14,955 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:36:14,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:36:15,418 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:36:15,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:36:15,629 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:36:15,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:15 BoogieIcfgContainer [2023-08-24 05:36:15,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:36:15,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:36:15,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:36:15,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:36:15,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:36:14" (1/3) ... [2023-08-24 05:36:15,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b65d033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:15, skipping insertion in model container [2023-08-24 05:36:15,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:14" (2/3) ... [2023-08-24 05:36:15,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b65d033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:15, skipping insertion in model container [2023-08-24 05:36:15,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:15" (3/3) ... [2023-08-24 05:36:15,638 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2023-08-24 05:36:15,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:36:15,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:36:15,655 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:36:15,744 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:36:15,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2023-08-24 05:36:15,824 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 05:36:15,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:15,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-24 05:36:15,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2023-08-24 05:36:15,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2023-08-24 05:36:15,837 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:36:15,846 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2023-08-24 05:36:15,848 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2023-08-24 05:36:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2023-08-24 05:36:15,878 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 05:36:15,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:15,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-24 05:36:15,881 INFO L119 LiptonReduction]: Number of co-enabled transitions 1692 [2023-08-24 05:36:23,277 INFO L134 LiptonReduction]: Checked pairs total: 4311 [2023-08-24 05:36:23,277 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-24 05:36:23,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:36:23,294 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;@5c688edd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:36:23,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:36:23,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:36:23,300 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-24 05:36:23,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:23,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:23,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:36:23,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:23,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 819312998, now seen corresponding path program 1 times [2023-08-24 05:36:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636758914] [2023-08-24 05:36:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:23,668 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-24 05:36:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636758914] [2023-08-24 05:36:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636758914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:36:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571498211] [2023-08-24 05:36:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:23,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:36:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:36:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:36:23,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 234 [2023-08-24 05:36:23,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:23,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:23,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 234 [2023-08-24 05:36:23,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:24,096 INFO L124 PetriNetUnfolderBase]: 855/1284 cut-off events. [2023-08-24 05:36:24,096 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:36:24,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1284 events. 855/1284 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5812 event pairs, 141 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 2600. Up to 1027 conditions per place. [2023-08-24 05:36:24,105 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 29 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-24 05:36:24,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 146 flow [2023-08-24 05:36:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:36:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:36:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-24 05:36:24,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170940170940171 [2023-08-24 05:36:24,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-24 05:36:24,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-24 05:36:24,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:24,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-24 05:36:24,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,141 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 363 transitions. [2023-08-24 05:36:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 146 flow [2023-08-24 05:36:24,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:36:24,145 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-24 05:36:24,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 05:36:24,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-24 05:36:24,149 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-24 05:36:24,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:24,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:24,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:36:24,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:24,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -380991973, now seen corresponding path program 1 times [2023-08-24 05:36:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743216497] [2023-08-24 05:36:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:24,367 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-24 05:36:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:24,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743216497] [2023-08-24 05:36:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743216497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:36:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827794648] [2023-08-24 05:36:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:24,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:36:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:36:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:36:24,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-08-24 05:36:24,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:24,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-08-24 05:36:24,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:24,748 INFO L124 PetriNetUnfolderBase]: 963/1468 cut-off events. [2023-08-24 05:36:24,749 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-08-24 05:36:24,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 1468 events. 963/1468 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6150 event pairs, 293 based on Foata normal form. 80/1548 useless extension candidates. Maximal degree in co-relation 3096. Up to 1213 conditions per place. [2023-08-24 05:36:24,757 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 29 selfloop transitions, 3 changer transitions 17/49 dead transitions. [2023-08-24 05:36:24,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 216 flow [2023-08-24 05:36:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2023-08-24 05:36:24,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-08-24 05:36:24,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2023-08-24 05:36:24,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2023-08-24 05:36:24,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:24,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2023-08-24 05:36:24,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,768 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 5 states and 576 transitions. [2023-08-24 05:36:24,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 216 flow [2023-08-24 05:36:24,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:36:24,770 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 73 flow [2023-08-24 05:36:24,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-24 05:36:24,771 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-24 05:36:24,771 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 73 flow [2023-08-24 05:36:24,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:24,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:24,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:24,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:36:24,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:24,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1074172060, now seen corresponding path program 1 times [2023-08-24 05:36:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295659426] [2023-08-24 05:36:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:24,997 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-24 05:36:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295659426] [2023-08-24 05:36:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295659426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004603644] [2023-08-24 05:36:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:24,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:36:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:36:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:36:25,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 234 [2023-08-24 05:36:25,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:25,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:25,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 234 [2023-08-24 05:36:25,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:25,320 INFO L124 PetriNetUnfolderBase]: 769/1230 cut-off events. [2023-08-24 05:36:25,320 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2023-08-24 05:36:25,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 1230 events. 769/1230 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5236 event pairs, 199 based on Foata normal form. 60/1290 useless extension candidates. Maximal degree in co-relation 2960. Up to 831 conditions per place. [2023-08-24 05:36:25,328 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-08-24 05:36:25,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 206 flow [2023-08-24 05:36:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2023-08-24 05:36:25,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897435897435897 [2023-08-24 05:36:25,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 573 transitions. [2023-08-24 05:36:25,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 573 transitions. [2023-08-24 05:36:25,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:25,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 573 transitions. [2023-08-24 05:36:25,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:25,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:25,335 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:25,335 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 73 flow. Second operand 5 states and 573 transitions. [2023-08-24 05:36:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 206 flow [2023-08-24 05:36:25,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:36:25,342 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 80 flow [2023-08-24 05:36:25,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-24 05:36:25,342 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-24 05:36:25,343 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 80 flow [2023-08-24 05:36:25,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:25,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:25,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:25,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:36:25,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:25,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -863261382, now seen corresponding path program 1 times [2023-08-24 05:36:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546555349] [2023-08-24 05:36:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:27,002 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-24 05:36:27,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546555349] [2023-08-24 05:36:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546555349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:27,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:36:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595645529] [2023-08-24 05:36:27,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:27,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:36:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:36:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:36:27,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 234 [2023-08-24 05:36:27,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 80 flow. Second operand has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:27,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 234 [2023-08-24 05:36:27,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:27,526 INFO L124 PetriNetUnfolderBase]: 825/1305 cut-off events. [2023-08-24 05:36:27,526 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-08-24 05:36:27,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1305 events. 825/1305 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5716 event pairs, 225 based on Foata normal form. 70/1375 useless extension candidates. Maximal degree in co-relation 3280. Up to 839 conditions per place. [2023-08-24 05:36:27,570 INFO L140 encePairwiseOnDemand]: 225/234 looper letters, 38 selfloop transitions, 8 changer transitions 21/69 dead transitions. [2023-08-24 05:36:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 69 transitions, 347 flow [2023-08-24 05:36:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:36:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:36:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 731 transitions. [2023-08-24 05:36:27,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390491452991453 [2023-08-24 05:36:27,573 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 731 transitions. [2023-08-24 05:36:27,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 731 transitions. [2023-08-24 05:36:27,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:27,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 731 transitions. [2023-08-24 05:36:27,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,579 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,579 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 80 flow. Second operand 8 states and 731 transitions. [2023-08-24 05:36:27,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 69 transitions, 347 flow [2023-08-24 05:36:27,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 69 transitions, 337 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:36:27,584 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 137 flow [2023-08-24 05:36:27,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-24 05:36:27,585 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-24 05:36:27,586 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 137 flow [2023-08-24 05:36:27,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:27,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:27,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:36:27,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:27,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash -991098024, now seen corresponding path program 1 times [2023-08-24 05:36:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955390439] [2023-08-24 05:36:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:27,828 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-24 05:36:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955390439] [2023-08-24 05:36:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955390439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:27,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096172983] [2023-08-24 05:36:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:27,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:36:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:36:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:36:27,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 234 [2023-08-24 05:36:27,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:27,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:27,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 234 [2023-08-24 05:36:27,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:28,105 INFO L124 PetriNetUnfolderBase]: 574/945 cut-off events. [2023-08-24 05:36:28,105 INFO L125 PetriNetUnfolderBase]: For 1309/1316 co-relation queries the response was YES. [2023-08-24 05:36:28,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3188 conditions, 945 events. 574/945 cut-off events. For 1309/1316 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4139 event pairs, 109 based on Foata normal form. 94/1033 useless extension candidates. Maximal degree in co-relation 3168. Up to 550 conditions per place. [2023-08-24 05:36:28,112 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 41 selfloop transitions, 4 changer transitions 31/78 dead transitions. [2023-08-24 05:36:28,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 519 flow [2023-08-24 05:36:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:36:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:36:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-08-24 05:36:28,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48547008547008547 [2023-08-24 05:36:28,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-08-24 05:36:28,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-08-24 05:36:28,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:28,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-08-24 05:36:28,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,119 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 137 flow. Second operand 5 states and 568 transitions. [2023-08-24 05:36:28,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 519 flow [2023-08-24 05:36:28,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 78 transitions, 497 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 05:36:28,125 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 167 flow [2023-08-24 05:36:28,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-24 05:36:28,127 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-08-24 05:36:28,127 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 167 flow [2023-08-24 05:36:28,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:28,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:28,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:36:28,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:28,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 180991657, now seen corresponding path program 1 times [2023-08-24 05:36:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446978964] [2023-08-24 05:36:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:28,384 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-24 05:36:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446978964] [2023-08-24 05:36:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446978964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:28,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:36:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35922669] [2023-08-24 05:36:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:36:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:36:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:36:28,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 234 [2023-08-24 05:36:28,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:28,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 234 [2023-08-24 05:36:28,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:28,639 INFO L124 PetriNetUnfolderBase]: 268/486 cut-off events. [2023-08-24 05:36:28,639 INFO L125 PetriNetUnfolderBase]: For 797/802 co-relation queries the response was YES. [2023-08-24 05:36:28,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 486 events. 268/486 cut-off events. For 797/802 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1897 event pairs, 54 based on Foata normal form. 47/531 useless extension candidates. Maximal degree in co-relation 1807. Up to 164 conditions per place. [2023-08-24 05:36:28,642 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 50 selfloop transitions, 7 changer transitions 26/85 dead transitions. [2023-08-24 05:36:28,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 611 flow [2023-08-24 05:36:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:36:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:36:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2023-08-24 05:36:28,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48575498575498577 [2023-08-24 05:36:28,645 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2023-08-24 05:36:28,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2023-08-24 05:36:28,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:28,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2023-08-24 05:36:28,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,650 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 167 flow. Second operand 6 states and 682 transitions. [2023-08-24 05:36:28,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 611 flow [2023-08-24 05:36:28,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 85 transitions, 603 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 05:36:28,655 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 219 flow [2023-08-24 05:36:28,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-24 05:36:28,658 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-08-24 05:36:28,658 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 219 flow [2023-08-24 05:36:28,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:28,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:28,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:36:28,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:28,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash -972686578, now seen corresponding path program 1 times [2023-08-24 05:36:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863693468] [2023-08-24 05:36:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:28,939 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-24 05:36:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863693468] [2023-08-24 05:36:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863693468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:36:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250002517] [2023-08-24 05:36:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:36:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:36:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:36:28,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 234 [2023-08-24 05:36:28,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:28,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:28,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 234 [2023-08-24 05:36:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:29,122 INFO L124 PetriNetUnfolderBase]: 171/317 cut-off events. [2023-08-24 05:36:29,122 INFO L125 PetriNetUnfolderBase]: For 660/665 co-relation queries the response was YES. [2023-08-24 05:36:29,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 317 events. 171/317 cut-off events. For 660/665 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1126 event pairs, 48 based on Foata normal form. 13/329 useless extension candidates. Maximal degree in co-relation 1224. Up to 128 conditions per place. [2023-08-24 05:36:29,124 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 46 selfloop transitions, 10 changer transitions 11/69 dead transitions. [2023-08-24 05:36:29,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 537 flow [2023-08-24 05:36:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:36:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:36:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2023-08-24 05:36:29,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47374847374847373 [2023-08-24 05:36:29,127 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 776 transitions. [2023-08-24 05:36:29,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 776 transitions. [2023-08-24 05:36:29,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:29,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 776 transitions. [2023-08-24 05:36:29,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,132 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 219 flow. Second operand 7 states and 776 transitions. [2023-08-24 05:36:29,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 537 flow [2023-08-24 05:36:29,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 466 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-24 05:36:29,141 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 190 flow [2023-08-24 05:36:29,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-24 05:36:29,141 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-08-24 05:36:29,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 190 flow [2023-08-24 05:36:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:29,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:29,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:36:29,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:29,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1763876998, now seen corresponding path program 1 times [2023-08-24 05:36:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520837718] [2023-08-24 05:36:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:29,377 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-24 05:36:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520837718] [2023-08-24 05:36:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520837718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:36:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338071475] [2023-08-24 05:36:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:36:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:36:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:36:29,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-08-24 05:36:29,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:29,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-08-24 05:36:29,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:29,560 INFO L124 PetriNetUnfolderBase]: 234/423 cut-off events. [2023-08-24 05:36:29,560 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2023-08-24 05:36:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 423 events. 234/423 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1606 event pairs, 102 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1593. Up to 283 conditions per place. [2023-08-24 05:36:29,563 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 38 selfloop transitions, 2 changer transitions 12/52 dead transitions. [2023-08-24 05:36:29,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 427 flow [2023-08-24 05:36:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:36:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:36:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-24 05:36:29,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2023-08-24 05:36:29,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-24 05:36:29,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-24 05:36:29,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:29,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-24 05:36:29,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,571 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,571 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 190 flow. Second operand 4 states and 452 transitions. [2023-08-24 05:36:29,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 427 flow [2023-08-24 05:36:29,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 337 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-08-24 05:36:29,576 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 146 flow [2023-08-24 05:36:29,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-24 05:36:29,577 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-08-24 05:36:29,578 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 146 flow [2023-08-24 05:36:29,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:29,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:29,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:29,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:36:29,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:29,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash -592550720, now seen corresponding path program 2 times [2023-08-24 05:36:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:29,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028843148] [2023-08-24 05:36:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:36:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028843148] [2023-08-24 05:36:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028843148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:36:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805401212] [2023-08-24 05:36:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:30,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:36:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:36:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:36:30,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 234 [2023-08-24 05:36:30,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:30,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:30,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 234 [2023-08-24 05:36:30,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:31,282 INFO L124 PetriNetUnfolderBase]: 129/266 cut-off events. [2023-08-24 05:36:31,282 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2023-08-24 05:36:31,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 266 events. 129/266 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1035 event pairs, 44 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 942. Up to 113 conditions per place. [2023-08-24 05:36:31,284 INFO L140 encePairwiseOnDemand]: 225/234 looper letters, 46 selfloop transitions, 8 changer transitions 17/72 dead transitions. [2023-08-24 05:36:31,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 490 flow [2023-08-24 05:36:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:36:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:36:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 783 transitions. [2023-08-24 05:36:31,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182692307692308 [2023-08-24 05:36:31,287 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 783 transitions. [2023-08-24 05:36:31,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 783 transitions. [2023-08-24 05:36:31,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:31,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 783 transitions. [2023-08-24 05:36:31,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.875) internal successors, (783), 8 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:31,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:31,293 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:31,293 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 146 flow. Second operand 8 states and 783 transitions. [2023-08-24 05:36:31,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 490 flow [2023-08-24 05:36:31,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 462 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-24 05:36:31,296 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 183 flow [2023-08-24 05:36:31,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-24 05:36:31,297 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-08-24 05:36:31,298 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 183 flow [2023-08-24 05:36:31,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:31,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:31,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:31,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:36:31,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:31,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -532912920, now seen corresponding path program 3 times [2023-08-24 05:36:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012085668] [2023-08-24 05:36:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:33,765 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-24 05:36:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012085668] [2023-08-24 05:36:33,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012085668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:33,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:33,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 05:36:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045988073] [2023-08-24 05:36:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:33,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 05:36:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 05:36:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-08-24 05:36:33,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 234 [2023-08-24 05:36:33,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 78.72727272727273) internal successors, (866), 11 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:33,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:33,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 234 [2023-08-24 05:36:33,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:34,224 INFO L124 PetriNetUnfolderBase]: 172/366 cut-off events. [2023-08-24 05:36:34,224 INFO L125 PetriNetUnfolderBase]: For 549/549 co-relation queries the response was YES. [2023-08-24 05:36:34,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 366 events. 172/366 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1670 event pairs, 29 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1342. Up to 179 conditions per place. [2023-08-24 05:36:34,227 INFO L140 encePairwiseOnDemand]: 224/234 looper letters, 61 selfloop transitions, 22 changer transitions 13/97 dead transitions. [2023-08-24 05:36:34,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 709 flow [2023-08-24 05:36:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:36:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:36:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 913 transitions. [2023-08-24 05:36:34,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2023-08-24 05:36:34,230 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 913 transitions. [2023-08-24 05:36:34,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 913 transitions. [2023-08-24 05:36:34,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:34,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 913 transitions. [2023-08-24 05:36:34,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.0) internal successors, (913), 11 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:34,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:34,237 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:34,237 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 183 flow. Second operand 11 states and 913 transitions. [2023-08-24 05:36:34,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 709 flow [2023-08-24 05:36:34,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 682 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-24 05:36:34,243 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 382 flow [2023-08-24 05:36:34,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=382, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-24 05:36:34,244 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2023-08-24 05:36:34,244 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 382 flow [2023-08-24 05:36:34,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.72727272727273) internal successors, (866), 11 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:36:34,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:34,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:34,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:36:34,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:36:34,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -785952078, now seen corresponding path program 4 times [2023-08-24 05:36:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151300977] [2023-08-24 05:36:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:36:34,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:36:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:36:34,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:36:34,436 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:36:34,437 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:36:34,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:36:34,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:36:34,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:36:34,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:36:34,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:36:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:36:34,441 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:34,446 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:36:34,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:36:34,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:36:34 BasicIcfg [2023-08-24 05:36:34,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:36:34,548 INFO L158 Benchmark]: Toolchain (without parser) took 20474.15ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 328.4MB in the beginning and 510.7MB in the end (delta: -182.3MB). Peak memory consumption was 257.5MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,549 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 354.4MB. Free memory is still 330.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:36:34,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.11ms. Allocated memory is still 354.4MB. Free memory was 328.4MB in the beginning and 303.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.14ms. Allocated memory is still 354.4MB. Free memory was 303.0MB in the beginning and 300.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,549 INFO L158 Benchmark]: Boogie Preprocessor took 63.88ms. Allocated memory is still 354.4MB. Free memory was 300.5MB in the beginning and 297.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,550 INFO L158 Benchmark]: RCFGBuilder took 937.36ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 263.8MB in the end (delta: 34.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,550 INFO L158 Benchmark]: TraceAbstraction took 18915.08ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 262.8MB in the beginning and 510.7MB in the end (delta: -247.8MB). Peak memory consumption was 190.3MB. Max. memory is 16.0GB. [2023-08-24 05:36:34,551 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.18ms. Allocated memory is still 354.4MB. Free memory is still 330.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 468.11ms. Allocated memory is still 354.4MB. Free memory was 328.4MB in the beginning and 303.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 84.14ms. Allocated memory is still 354.4MB. Free memory was 303.0MB in the beginning and 300.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 63.88ms. Allocated memory is still 354.4MB. Free memory was 300.5MB in the beginning and 297.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 937.36ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 263.8MB in the end (delta: 34.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 18915.08ms. Allocated memory was 354.4MB in the beginning and 792.7MB in the end (delta: 438.3MB). Free memory was 262.8MB in the beginning and 510.7MB in the end (delta: -247.8MB). Peak memory consumption was 190.3MB. 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: 7.4s, 129 PlacesBefore, 32 PlacesAfterwards, 121 TransitionsBefore, 23 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 4311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1899, independent: 1733, independent conditional: 0, independent unconditional: 1733, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 935, independent: 891, independent conditional: 0, independent unconditional: 891, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1899, independent: 842, independent conditional: 0, independent unconditional: 842, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 935, unknown conditional: 0, unknown unconditional: 935] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2257, ((void *)0), P0, ((void *)0))=8, t2257={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2258; [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2258, ((void *)0), P1, ((void *)0))=9, t2257={6:0}, t2258={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2259; [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2259, ((void *)0), P2, ((void *)0))=10, t2257={6:0}, t2258={7:0}, t2259={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2257={6:0}, t2258={7:0}, t2259={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: 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: 862]: 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, 149 locations, 6 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: 18.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1156 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 3 mSDtfsCounter, 1156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=10, InterpolantAutomatonStates: 62, 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.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:36:34,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...