/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:55:46,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:55:46,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:55:46,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:55:46,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:55:46,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:55:46,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:55:46,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:55:46,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:55:46,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:55:46,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:55:46,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:55:46,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:55:46,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:55:46,263 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:55:46,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:55:46,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:55:46,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:55:46,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:55:46,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:55:46,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:55:46,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:55:46,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:55:46,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:55:46,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:55:46,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:55:46,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:55:46,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:55:46,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:55:46,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-03 23:55:46,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:55:46,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:55:46,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:55:46,474 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:55:46,474 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:55:46,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i [2023-08-03 23:55:47,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:55:47,520 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:55:47,520 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i [2023-08-03 23:55:47,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7aa9134/5e7d5afeb71843c88d7b90af35708943/FLAGc599a8cdd [2023-08-03 23:55:47,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7aa9134/5e7d5afeb71843c88d7b90af35708943 [2023-08-03 23:55:47,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:55:47,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:55:47,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:55:47,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:55:47,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:55:47,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42082a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47, skipping insertion in model container [2023-08-03 23:55:47,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:55:47,674 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i[983,996] [2023-08-03 23:55:47,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:55:47,842 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:55:47,855 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i[983,996] [2023-08-03 23:55:47,873 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:55:47,874 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:55:47,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:55:47,923 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:55:47,923 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:55:47,927 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:55:47,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47 WrapperNode [2023-08-03 23:55:47,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:55:47,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:55:47,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:55:47,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:55:47,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,966 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 184 [2023-08-03 23:55:47,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:55:47,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:55:47,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:55:47,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:55:47,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:47,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:55:47,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:55:47,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:55:47,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:55:47,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (1/1) ... [2023-08-03 23:55:48,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:55:48,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:48,029 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-03 23:55:48,038 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-03 23:55:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:55:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:55:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:55:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:55:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:55:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:55:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:55:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:55:48,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:55:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:55:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:55:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:55:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:55:48,058 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:55:48,158 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:55:48,159 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:55:48,428 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:55:48,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:55:48,570 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:55:48,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:55:48 BoogieIcfgContainer [2023-08-03 23:55:48,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:55:48,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:55:48,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:55:48,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:55:48,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:55:47" (1/3) ... [2023-08-03 23:55:48,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f8eca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:55:48, skipping insertion in model container [2023-08-03 23:55:48,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:47" (2/3) ... [2023-08-03 23:55:48,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f8eca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:55:48, skipping insertion in model container [2023-08-03 23:55:48,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:55:48" (3/3) ... [2023-08-03 23:55:48,579 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi005_bound2.i [2023-08-03 23:55:48,584 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:55:48,590 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:55:48,590 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-03 23:55:48,590 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:55:48,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:55:48,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 23:55:48,723 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 23:55:48,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:48,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 643 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 23:55:48,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 23:55:48,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 166 flow [2023-08-03 23:55:48,733 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:48,747 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 23:55:48,749 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 78 transitions, 166 flow [2023-08-03 23:55:48,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 78 transitions, 166 flow [2023-08-03 23:55:48,774 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-08-03 23:55:48,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 173 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-03 23:55:48,776 INFO L119 LiptonReduction]: Number of co-enabled transitions 652 [2023-08-03 23:55:50,866 INFO L134 LiptonReduction]: Checked pairs total: 1652 [2023-08-03 23:55:50,867 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-08-03 23:55:50,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:55:50,879 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=true, 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;@2165b327, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:55:50,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:55:50,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:55:50,882 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-08-03 23:55:50,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:50,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:50,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:55:50,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:50,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 515053447, now seen corresponding path program 1 times [2023-08-03 23:55:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696786557] [2023-08-03 23:55:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:55:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696786557] [2023-08-03 23:55:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696786557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:55:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:55:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677511733] [2023-08-03 23:55:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:51,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:55:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:55:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:55:51,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168 [2023-08-03 23:55:51,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:51,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:51,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168 [2023-08-03 23:55:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:51,140 INFO L124 PetriNetUnfolderBase]: 85/183 cut-off events. [2023-08-03 23:55:51,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:51,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 183 events. 85/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 608 event pairs, 28 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 352. Up to 162 conditions per place. [2023-08-03 23:55:51,143 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 19 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-03 23:55:51,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 100 flow [2023-08-03 23:55:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:55:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:55:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-03 23:55:51,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5496031746031746 [2023-08-03 23:55:51,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-03 23:55:51,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-03 23:55:51,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:51,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-03 23:55:51,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:51,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:51,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:51,171 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 50 flow. Second operand 3 states and 277 transitions. [2023-08-03 23:55:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 100 flow [2023-08-03 23:55:51,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:55:51,174 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 58 flow [2023-08-03 23:55:51,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-08-03 23:55:51,178 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-08-03 23:55:51,178 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 58 flow [2023-08-03 23:55:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:51,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:51,178 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:55:51,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:55:51,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:51,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1215004301, now seen corresponding path program 1 times [2023-08-03 23:55:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:51,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642116306] [2023-08-03 23:55:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:55:51,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:55:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:55:51,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:55:51,237 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:55:51,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:55:51,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:55:51,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:55:51,239 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:55:51,240 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:55:51,241 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:55:51,241 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:55:51,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:55:51,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:55:51,312 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-03 23:55:51,313 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:51,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 468 events. 30/468 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2030 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:55:51,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:55:51,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 218 flow [2023-08-03 23:55:51,316 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:51,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 218 flow [2023-08-03 23:55:51,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 218 flow [2023-08-03 23:55:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 218 flow [2023-08-03 23:55:51,336 INFO L124 PetriNetUnfolderBase]: 3/225 cut-off events. [2023-08-03 23:55:51,336 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:51,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 225 events. 3/225 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 607 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 173. Up to 9 conditions per place. [2023-08-03 23:55:51,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 1940 [2023-08-03 23:55:53,471 INFO L134 LiptonReduction]: Checked pairs total: 7566 [2023-08-03 23:55:53,472 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-03 23:55:53,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:55:53,474 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=true, 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;@2165b327, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:55:53,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:55:53,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:55:53,477 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2023-08-03 23:55:53,477 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:55:53,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:53,478 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:55:53,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:53,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash -51925267, now seen corresponding path program 1 times [2023-08-03 23:55:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:53,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320464369] [2023-08-03 23:55:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:55:53,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320464369] [2023-08-03 23:55:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320464369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:55:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:55:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330750968] [2023-08-03 23:55:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:53,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:55:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:55:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:55:53,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 192 [2023-08-03 23:55:53,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:53,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:53,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 192 [2023-08-03 23:55:53,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:54,460 INFO L124 PetriNetUnfolderBase]: 7481/10964 cut-off events. [2023-08-03 23:55:54,460 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-08-03 23:55:54,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22115 conditions, 10964 events. 7481/10964 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 64611 event pairs, 5264 based on Foata normal form. 0/9464 useless extension candidates. Maximal degree in co-relation 4882. Up to 10438 conditions per place. [2023-08-03 23:55:54,507 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 32 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-03 23:55:54,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 172 flow [2023-08-03 23:55:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:55:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:55:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-03 23:55:54,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-03 23:55:54,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-03 23:55:54,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-03 23:55:54,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:54,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-03 23:55:54,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:54,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:54,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:54,511 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 320 transitions. [2023-08-03 23:55:54,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 172 flow [2023-08-03 23:55:54,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:55:54,513 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 102 flow [2023-08-03 23:55:54,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-03 23:55:54,514 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-03 23:55:54,514 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 102 flow [2023-08-03 23:55:54,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:54,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:54,514 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:55:54,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:55:54,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:54,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1532017843, now seen corresponding path program 1 times [2023-08-03 23:55:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763250107] [2023-08-03 23:55:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:55:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763250107] [2023-08-03 23:55:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763250107] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458889434] [2023-08-03 23:55:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:54,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:55:54,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:55:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:54,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:55:54,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:55:54,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:55:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458889434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:55:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:55:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790389998] [2023-08-03 23:55:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:54,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:55:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:55:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:55:54,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192 [2023-08-03 23:55:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:54,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:54,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192 [2023-08-03 23:55:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:55,590 INFO L124 PetriNetUnfolderBase]: 7457/10988 cut-off events. [2023-08-03 23:55:55,590 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2023-08-03 23:55:55,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22078 conditions, 10988 events. 7457/10988 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 65531 event pairs, 3500 based on Foata normal form. 16/9524 useless extension candidates. Maximal degree in co-relation 5877. Up to 10355 conditions per place. [2023-08-03 23:55:55,636 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 37 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-03 23:55:55,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 204 flow [2023-08-03 23:55:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:55:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:55:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-03 23:55:55,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-03 23:55:55,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-03 23:55:55,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-03 23:55:55,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:55,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-03 23:55:55,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:55,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:55,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:55,642 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 102 flow. Second operand 5 states and 512 transitions. [2023-08-03 23:55:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 204 flow [2023-08-03 23:55:55,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:55:55,643 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 116 flow [2023-08-03 23:55:55,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-03 23:55:55,644 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-03 23:55:55,644 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 116 flow [2023-08-03 23:55:55,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:55,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:55,644 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:55:55,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 23:55:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:55,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:55,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 420280733, now seen corresponding path program 1 times [2023-08-03 23:55:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827321211] [2023-08-03 23:55:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:55:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827321211] [2023-08-03 23:55:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827321211] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432534421] [2023-08-03 23:55:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:55,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:55:55,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:55:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:55,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:55:55,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:55:55,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:55:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:55:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432534421] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:55:56,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:55:56,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:55:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166040758] [2023-08-03 23:55:56,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:55:56,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:55:56,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:56,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:55:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:55:56,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192 [2023-08-03 23:55:56,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:56,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:56,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192 [2023-08-03 23:55:56,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:56,710 INFO L124 PetriNetUnfolderBase]: 6322/9157 cut-off events. [2023-08-03 23:55:56,711 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-08-03 23:55:56,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18459 conditions, 9157 events. 6322/9157 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51921 event pairs, 2800 based on Foata normal form. 4/7977 useless extension candidates. Maximal degree in co-relation 4887. Up to 8641 conditions per place. [2023-08-03 23:55:56,747 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 37 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-03 23:55:56,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 210 flow [2023-08-03 23:55:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:55:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:55:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-03 23:55:56,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2023-08-03 23:55:56,748 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-03 23:55:56,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-03 23:55:56,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:56,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-03 23:55:56,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:56,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:56,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:56,751 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 116 flow. Second operand 4 states and 417 transitions. [2023-08-03 23:55:56,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 210 flow [2023-08-03 23:55:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 205 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:55:56,752 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 109 flow [2023-08-03 23:55:56,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-08-03 23:55:56,753 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-03 23:55:56,753 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 109 flow [2023-08-03 23:55:56,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:56,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:56,753 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:55:56,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 23:55:56,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:56,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:55:56,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1276256014, now seen corresponding path program 1 times [2023-08-03 23:55:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843123439] [2023-08-03 23:55:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:55:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843123439] [2023-08-03 23:55:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843123439] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778649032] [2023-08-03 23:55:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:56,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:57,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:55:57,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:55:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:57,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:55:57,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:55:57,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:55:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778649032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:55:57,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:55:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722495289] [2023-08-03 23:55:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:55:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:55:57,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:55:57,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 192 [2023-08-03 23:55:57,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:57,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:57,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 192 [2023-08-03 23:55:57,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:57,463 INFO L124 PetriNetUnfolderBase]: 2994/4629 cut-off events. [2023-08-03 23:55:57,463 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2023-08-03 23:55:57,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9503 conditions, 4629 events. 2994/4629 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 24524 event pairs, 42 based on Foata normal form. 1024/5077 useless extension candidates. Maximal degree in co-relation 2519. Up to 3888 conditions per place. [2023-08-03 23:55:57,474 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2023-08-03 23:55:57,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 241 flow [2023-08-03 23:55:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:55:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:55:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-03 23:55:57,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55859375 [2023-08-03 23:55:57,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-03 23:55:57,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-03 23:55:57,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:57,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-03 23:55:57,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:57,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:57,478 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:57,478 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 109 flow. Second operand 4 states and 429 transitions. [2023-08-03 23:55:57,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 241 flow [2023-08-03 23:55:57,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:55:57,482 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2023-08-03 23:55:57,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2023-08-03 23:55:57,483 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-03 23:55:57,483 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2023-08-03 23:55:57,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:55:57,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:55:57,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:55:57,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 23:55:57,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:57,688 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:55:57,688 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:55:57,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:55:57,722 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-03 23:55:57,722 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:57,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 468 events. 30/468 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2030 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:55:57,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 23:55:57,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 123 transitions, 266 flow [2023-08-03 23:55:57,725 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:57,729 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 123 transitions, 266 flow [2023-08-03 23:55:57,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 123 transitions, 266 flow [2023-08-03 23:55:57,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 266 flow [2023-08-03 23:55:57,755 INFO L124 PetriNetUnfolderBase]: 30/467 cut-off events. [2023-08-03 23:55:57,756 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:55:57,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 467 events. 30/467 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2021 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:55:57,761 INFO L119 LiptonReduction]: Number of co-enabled transitions 3752 [2023-08-03 23:56:00,165 INFO L134 LiptonReduction]: Checked pairs total: 13427 [2023-08-03 23:56:00,165 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-03 23:56:00,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:56:00,178 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=true, 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;@2165b327, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:56:00,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 23:56:00,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:56:00,180 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 23:56:00,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:56:00,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:00,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:56:00,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:00,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 808502492, now seen corresponding path program 1 times [2023-08-03 23:56:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217612882] [2023-08-03 23:56:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:00,213 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-03 23:56:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217612882] [2023-08-03 23:56:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217612882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:56:00,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:56:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:56:00,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014954896] [2023-08-03 23:56:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:56:00,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:56:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:56:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:56:00,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-03 23:56:00,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:00,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:00,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-03 23:56:00,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:04,123 INFO L124 PetriNetUnfolderBase]: 37938/53037 cut-off events. [2023-08-03 23:56:04,123 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-03 23:56:04,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104977 conditions, 53037 events. 37938/53037 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 328929 event pairs, 28056 based on Foata normal form. 1460/43953 useless extension candidates. Maximal degree in co-relation 23097. Up to 51115 conditions per place. [2023-08-03 23:56:04,342 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 39 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-03 23:56:04,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 194 flow [2023-08-03 23:56:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-03 23:56:04,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947209653092006 [2023-08-03 23:56:04,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-03 23:56:04,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-03 23:56:04,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:04,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-03 23:56:04,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:04,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:04,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:04,346 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 104 flow. Second operand 3 states and 328 transitions. [2023-08-03 23:56:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 194 flow [2023-08-03 23:56:04,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:56:04,349 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 112 flow [2023-08-03 23:56:04,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-03 23:56:04,350 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-03 23:56:04,350 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 112 flow [2023-08-03 23:56:04,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:04,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:04,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:04,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:56:04,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:04,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 16675466, now seen corresponding path program 1 times [2023-08-03 23:56:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048976780] [2023-08-03 23:56:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:56:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048976780] [2023-08-03 23:56:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048976780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:56:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063339950] [2023-08-03 23:56:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:04,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:56:04,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:56:04,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:56:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:04,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:56:04,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:56:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:56:04,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:56:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:56:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063339950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:56:04,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:56:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:56:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83645654] [2023-08-03 23:56:04,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:56:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:56:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:56:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:56:04,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 221 [2023-08-03 23:56:04,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:04,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:04,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 221 [2023-08-03 23:56:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:07,955 INFO L124 PetriNetUnfolderBase]: 31938/44037 cut-off events. [2023-08-03 23:56:07,955 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-08-03 23:56:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87124 conditions, 44037 events. 31938/44037 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 259802 event pairs, 16140 based on Foata normal form. 4/35625 useless extension candidates. Maximal degree in co-relation 23090. Up to 42409 conditions per place. [2023-08-03 23:56:08,118 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 44 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-03 23:56:08,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 230 flow [2023-08-03 23:56:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:56:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:56:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-03 23:56:08,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-08-03 23:56:08,120 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-03 23:56:08,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-03 23:56:08,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:08,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-03 23:56:08,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-03 23:56:08,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:08,122 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:08,122 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 112 flow. Second operand 4 states and 425 transitions. [2023-08-03 23:56:08,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 230 flow [2023-08-03 23:56:08,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:56:08,123 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 124 flow [2023-08-03 23:56:08,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-03 23:56:08,123 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-03 23:56:08,124 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 124 flow [2023-08-03 23:56:08,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:08,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:08,124 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:08,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 23:56:08,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:08,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:08,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1739052153, now seen corresponding path program 1 times [2023-08-03 23:56:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530510517] [2023-08-03 23:56:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:56:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530510517] [2023-08-03 23:56:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530510517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:56:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:56:08,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:56:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845423928] [2023-08-03 23:56:08,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:56:08,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:56:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:56:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:56:08,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 221 [2023-08-03 23:56:08,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:08,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:08,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 221 [2023-08-03 23:56:08,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:11,519 INFO L124 PetriNetUnfolderBase]: 30090/41549 cut-off events. [2023-08-03 23:56:11,520 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2023-08-03 23:56:11,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82108 conditions, 41549 events. 30090/41549 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 244151 event pairs, 6426 based on Foata normal form. 0/34061 useless extension candidates. Maximal degree in co-relation 21749. Up to 38929 conditions per place. [2023-08-03 23:56:11,672 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 51 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-03 23:56:11,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 271 flow [2023-08-03 23:56:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-03 23:56:11,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526395173453997 [2023-08-03 23:56:11,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-03 23:56:11,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-03 23:56:11,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:11,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-03 23:56:11,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:11,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:11,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:11,676 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 124 flow. Second operand 3 states and 349 transitions. [2023-08-03 23:56:11,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 271 flow [2023-08-03 23:56:11,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:56:11,681 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 138 flow [2023-08-03 23:56:11,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-03 23:56:11,683 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-03 23:56:11,683 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 138 flow [2023-08-03 23:56:11,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:56:11,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:11,684 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:11,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:56:11,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:11,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1923957434, now seen corresponding path program 1 times [2023-08-03 23:56:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125178595] [2023-08-03 23:56:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:56:11,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:56:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:56:11,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:56:11,726 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:56:11,726 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 23:56:11,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 23:56:11,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 23:56:11,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-08-03 23:56:11,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-08-03 23:56:11,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-03 23:56:11,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 23:56:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:56:11,727 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:56:11,727 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:56:11,730 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:56:11,730 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:56:11,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:56:11 BasicIcfg [2023-08-03 23:56:11,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:56:11,784 INFO L158 Benchmark]: Toolchain (without parser) took 24244.67ms. Allocated memory was 539.0MB in the beginning and 7.0GB in the end (delta: 6.4GB). Free memory was 499.7MB in the beginning and 5.9GB in the end (delta: -5.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-03 23:56:11,784 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 373.3MB. Free memory is still 325.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:56:11,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.62ms. Allocated memory is still 539.0MB. Free memory was 499.4MB in the beginning and 474.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 23:56:11,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 539.0MB. Free memory was 474.3MB in the beginning and 471.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:56:11,785 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 539.0MB. Free memory was 471.0MB in the beginning and 468.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:56:11,785 INFO L158 Benchmark]: RCFGBuilder took 582.88ms. Allocated memory is still 539.0MB. Free memory was 468.9MB in the beginning and 482.3MB in the end (delta: -13.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. [2023-08-03 23:56:11,785 INFO L158 Benchmark]: TraceAbstraction took 23210.03ms. Allocated memory was 539.0MB in the beginning and 7.0GB in the end (delta: 6.4GB). Free memory was 481.2MB in the beginning and 5.9GB in the end (delta: -5.4GB). Peak memory consumption was 981.1MB. Max. memory is 16.0GB. [2023-08-03 23:56:11,787 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.08ms. Allocated memory is still 373.3MB. Free memory is still 325.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 387.62ms. Allocated memory is still 539.0MB. Free memory was 499.4MB in the beginning and 474.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 539.0MB. Free memory was 474.3MB in the beginning and 471.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 539.0MB. Free memory was 471.0MB in the beginning and 468.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 582.88ms. Allocated memory is still 539.0MB. Free memory was 468.9MB in the beginning and 482.3MB in the end (delta: -13.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. * TraceAbstraction took 23210.03ms. Allocated memory was 539.0MB in the beginning and 7.0GB in the end (delta: 6.4GB). Free memory was 481.2MB in the beginning and 5.9GB in the end (delta: -5.4GB). Peak memory consumption was 981.1MB. 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: 2.1s, 82 PlacesBefore, 25 PlacesAfterwards, 78 TransitionsBefore, 20 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 1652 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 834, independent: 710, independent conditional: 0, independent unconditional: 710, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 330, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 834, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 330, unknown conditional: 0, unknown unconditional: 330] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 105 PlacesBefore, 44 PlacesAfterwards, 97 TransitionsBefore, 35 TransitionsAfterwards, 1940 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 7566 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2611, independent: 2353, independent conditional: 0, independent unconditional: 2353, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 880, independent: 850, independent conditional: 0, independent unconditional: 850, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2611, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 880, unknown conditional: 0, unknown unconditional: 880] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 128 PlacesBefore, 50 PlacesAfterwards, 123 TransitionsBefore, 42 TransitionsAfterwards, 3752 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 13427 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4353, independent: 4048, independent conditional: 0, independent unconditional: 4048, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1812, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4353, independent: 2285, independent conditional: 0, independent unconditional: 2285, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 1812, unknown conditional: 0, unknown unconditional: 1812] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1665[2]; [L835] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND TRUE 0 asdf<2 [L835] FCALL, FORK 0 pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0))=-1, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND TRUE 0 asdf<2 [L835] FCALL, FORK 0 pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0))=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND FALSE 0 !(asdf<2) [L836] 0 pthread_t t1666[2]; [L837] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, t1666={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] COND TRUE 0 asdf<2 [L837] FCALL, FORK 0 pthread_create(&t1666[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1666[asdf], ((void *)0), P1, ((void *)0))=1, t1665={5:0}, t1666={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 1 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L775] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L775] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0] - 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 121 locations, 7 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: 2.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 140 locations, 9 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: 6.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, InterpolantAutomatonStates: 16, 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 9 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: 14.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=3, InterpolantAutomatonStates: 10, 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6/9 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-03 23:56:11,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...