/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi010_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:49:39,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:49:39,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:49:39,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:49:39,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:49:39,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:49:39,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:49:39,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:49:39,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:49:39,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:49:39,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:49:39,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:49:39,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:49:39,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:49:39,546 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:49:39,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:49:39,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:49:39,547 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:49:39,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:49:39,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:49:39,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:49:39,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:49:39,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:49:39,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:49:39,557 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:49:39,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:49:39,557 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:49:39,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:49:39,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:49:39,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:49:39,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:49:39,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:49:39,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:49:39,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:49:39,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:49:39,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:49:39,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:49:39,559 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:49:39,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:49:39,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:49:39,559 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:49:39,561 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 -> TOGETHER [2023-08-03 17:49:39,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:49:39,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:49:39,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:49:39,768 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:49:39,769 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:49:39,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi010_bound2.i [2023-08-03 17:49:40,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:49:40,841 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:49:40,842 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi010_bound2.i [2023-08-03 17:49:40,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4b6846f/936462d902fe4ac1adaff69fcaa5950d/FLAG3dec8f60d [2023-08-03 17:49:40,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4b6846f/936462d902fe4ac1adaff69fcaa5950d [2023-08-03 17:49:40,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:49:40,863 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:49:40,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:49:40,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:49:40,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:49:40,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:49:40" (1/1) ... [2023-08-03 17:49:40,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70537f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:40, skipping insertion in model container [2023-08-03 17:49:40,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:49:40" (1/1) ... [2023-08-03 17:49:40,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:49:41,009 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_rfi010_bound2.i[983,996] [2023-08-03 17:49:41,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:49:41,190 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:49:41,203 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_rfi010_bound2.i[983,996] [2023-08-03 17:49:41,218 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:49:41,219 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:49:41,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:49:41,258 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:49:41,259 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:49:41,263 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:49:41,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41 WrapperNode [2023-08-03 17:49:41,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:49:41,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:49:41,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:49:41,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:49:41,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,318 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-08-03 17:49:41,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:49:41,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:49:41,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:49:41,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:49:41,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:49:41,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:49:41,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:49:41,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:49:41,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (1/1) ... [2023-08-03 17:49:41,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:49:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:49:41,389 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 17:49:41,402 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 17:49:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:49:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:49:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:49:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:49:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:49:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:49:41,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:49:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:49:41,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:49:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:49:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:49:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:49:41,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:49:41,422 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 17:49:41,532 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:49:41,534 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:49:41,756 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:49:41,922 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:49:41,922 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:49:41,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:49:41 BoogieIcfgContainer [2023-08-03 17:49:41,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:49:41,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:49:41,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:49:41,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:49:41,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:49:40" (1/3) ... [2023-08-03 17:49:41,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ccdabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:49:41, skipping insertion in model container [2023-08-03 17:49:41,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:49:41" (2/3) ... [2023-08-03 17:49:41,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ccdabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:49:41, skipping insertion in model container [2023-08-03 17:49:41,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:49:41" (3/3) ... [2023-08-03 17:49:41,931 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi010_bound2.i [2023-08-03 17:49:41,937 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:49:41,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:49:41,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:49:41,943 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:49:41,979 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:49:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,087 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-03 17:49:42,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:49:42,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 616 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:49:42,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:49:42,111 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 216 flow [2023-08-03 17:49:42,156 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2023-08-03 17:49:42,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:49:42,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 220 events. 14/220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 616 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:49:42,159 INFO L119 LiptonReduction]: Number of co-enabled transitions 1398 [2023-08-03 17:49:44,561 INFO L134 LiptonReduction]: Checked pairs total: 3391 [2023-08-03 17:49:44,561 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-03 17:49:44,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:49:44,573 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;@3d21acfa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:49:44,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 17:49:44,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:49:44,576 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:49:44,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:49:44,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:44,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:49:44,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:49:44,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 466958864, now seen corresponding path program 1 times [2023-08-03 17:49:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762336322] [2023-08-03 17:49:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:44,772 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 17:49:44,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:44,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762336322] [2023-08-03 17:49:44,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762336322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:49:44,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:49:44,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:49:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974459047] [2023-08-03 17:49:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:49:44,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:49:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:44,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:49:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:49:44,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-08-03 17:49:44,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 17:49:44,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:44,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-08-03 17:49:44,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:44,925 INFO L124 PetriNetUnfolderBase]: 352/658 cut-off events. [2023-08-03 17:49:44,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:49:44,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 658 events. 352/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2857 event pairs, 160 based on Foata normal form. 28/562 useless extension candidates. Maximal degree in co-relation 1274. Up to 609 conditions per place. [2023-08-03 17:49:44,932 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 17:49:44,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 120 flow [2023-08-03 17:49:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:49:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:49:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-03 17:49:44,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4939550949913644 [2023-08-03 17:49:44,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-03 17:49:44,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-03 17:49:44,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:44,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-03 17:49:44,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 17:49:44,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 17:49:44,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 17:49:44,960 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 62 flow. Second operand 3 states and 286 transitions. [2023-08-03 17:49:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 120 flow [2023-08-03 17:49:44,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:49:44,963 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 68 flow [2023-08-03 17:49:44,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-03 17:49:44,967 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-03 17:49:44,967 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 68 flow [2023-08-03 17:49:44,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 17:49:44,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:44,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:49:44,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:49:44,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-03 17:49:44,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1577764823, now seen corresponding path program 1 times [2023-08-03 17:49:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377272197] [2023-08-03 17:49:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:49:45,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:49:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:49:45,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:49:45,042 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:49:45,043 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-03 17:49:45,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 17:49:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 17:49:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-03 17:49:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 17:49:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:49:45,049 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:49:45,051 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:49:45,051 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:49:45,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:49:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,126 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-03 17:49:45,126 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:49:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 456 events. 30/456 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 328. Up to 18 conditions per place. [2023-08-03 17:49:45,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,130 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:49:45,130 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,130 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 120 transitions, 264 flow [2023-08-03 17:49:45,167 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-03 17:49:45,167 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:49:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 456 events. 30/456 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1943 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 328. Up to 18 conditions per place. [2023-08-03 17:49:45,172 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-08-03 17:49:47,392 INFO L134 LiptonReduction]: Checked pairs total: 9016 [2023-08-03 17:49:47,392 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-03 17:49:47,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:49:47,394 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;@3d21acfa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:49:47,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:49:47,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:49:47,396 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 17:49:47,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:49:47,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:47,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:49:47,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:47,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 688348779, now seen corresponding path program 1 times [2023-08-03 17:49:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140280552] [2023-08-03 17:49:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:47,429 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 17:49:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140280552] [2023-08-03 17:49:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140280552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:49:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:49:47,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:49:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506463076] [2023-08-03 17:49:47,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:49:47,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:49:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:49:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:49:47,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-08-03 17:49:47,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 17:49:47,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:47,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-08-03 17:49:47,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:49,786 INFO L124 PetriNetUnfolderBase]: 21488/30711 cut-off events. [2023-08-03 17:49:49,786 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2023-08-03 17:49:49,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60609 conditions, 30711 events. 21488/30711 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 186823 event pairs, 15656 based on Foata normal form. 860/26574 useless extension candidates. Maximal degree in co-relation 13355. Up to 29265 conditions per place. [2023-08-03 17:49:49,929 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-03 17:49:49,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 184 flow [2023-08-03 17:49:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:49:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:49:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-08-03 17:49:49,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2023-08-03 17:49:49,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-08-03 17:49:49,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-08-03 17:49:49,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:49,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-08-03 17:49:49,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 17:49:49,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:49,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:49,933 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 102 flow. Second operand 3 states and 327 transitions. [2023-08-03 17:49:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 184 flow [2023-08-03 17:49:49,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:49:49,935 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 108 flow [2023-08-03 17:49:49,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-03 17:49:49,936 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-03 17:49:49,936 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 108 flow [2023-08-03 17:49:49,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 17:49:49,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:49,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:49:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:49:49,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:49,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -785896102, now seen corresponding path program 1 times [2023-08-03 17:49:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001787082] [2023-08-03 17:49:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:50,006 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 17:49:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001787082] [2023-08-03 17:49:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001787082] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:49:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794273520] [2023-08-03 17:49:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:49:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:49:50,012 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 17:49:50,028 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 17:49:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:50,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:49:50,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:49:50,114 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 17:49:50,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:49:50,134 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 17:49:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794273520] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:49:50,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:49:50,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:49:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063763493] [2023-08-03 17:49:50,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:49:50,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:49:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:49:50,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:49:50,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215 [2023-08-03 17:49:50,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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 17:49:50,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:50,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215 [2023-08-03 17:49:50,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:52,114 INFO L124 PetriNetUnfolderBase]: 18130/25561 cut-off events. [2023-08-03 17:49:52,114 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-03 17:49:52,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50396 conditions, 25561 events. 18130/25561 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 148120 event pairs, 8812 based on Foata normal form. 4/21596 useless extension candidates. Maximal degree in co-relation 13368. Up to 24281 conditions per place. [2023-08-03 17:49:52,202 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 40 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-03 17:49:52,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 218 flow [2023-08-03 17:49:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:49:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:49:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-03 17:49:52,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2023-08-03 17:49:52,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-03 17:49:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-03 17:49:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:52,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-03 17:49:52,205 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 17:49:52,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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 17:49:52,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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 17:49:52,207 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 108 flow. Second operand 4 states and 425 transitions. [2023-08-03 17:49:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 218 flow [2023-08-03 17:49:52,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:49:52,209 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 126 flow [2023-08-03 17:49:52,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 17:49:52,211 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:49:52,211 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 126 flow [2023-08-03 17:49:52,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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 17:49:52,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:52,211 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:49:52,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:49:52,418 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 17:49:52,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:52,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 433558089, now seen corresponding path program 1 times [2023-08-03 17:49:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845036991] [2023-08-03 17:49:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:52,491 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 17:49:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845036991] [2023-08-03 17:49:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845036991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:49:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397939993] [2023-08-03 17:49:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:49:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:49:52,495 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 17:49:52,497 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 17:49:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:52,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:49:52,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:49:52,569 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 17:49:52,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:49:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397939993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:49:52,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:49:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:49:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769212786] [2023-08-03 17:49:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:49:52,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:49:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:49:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:49:52,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215 [2023-08-03 17:49:52,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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 17:49:52,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:52,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215 [2023-08-03 17:49:52,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:54,606 INFO L124 PetriNetUnfolderBase]: 18106/25517 cut-off events. [2023-08-03 17:49:54,606 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2023-08-03 17:49:54,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50364 conditions, 25517 events. 18106/25517 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 147886 event pairs, 8800 based on Foata normal form. 16/21564 useless extension candidates. Maximal degree in co-relation 13345. Up to 24280 conditions per place. [2023-08-03 17:49:54,690 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 40 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-08-03 17:49:54,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 224 flow [2023-08-03 17:49:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:49:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:49:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-03 17:49:54,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827906976744186 [2023-08-03 17:49:54,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-03 17:49:54,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-03 17:49:54,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:54,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-03 17:49:54,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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 17:49:54,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 17:49:54,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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 17:49:54,695 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 126 flow. Second operand 5 states and 519 transitions. [2023-08-03 17:49:54,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 224 flow [2023-08-03 17:49:54,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 217 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:49:54,696 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 115 flow [2023-08-03 17:49:54,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-03 17:49:54,697 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:49:54,697 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 115 flow [2023-08-03 17:49:54,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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 17:49:54,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:54,697 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:49:54,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 17:49:54,906 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 17:49:54,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:54,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash 37758986, now seen corresponding path program 1 times [2023-08-03 17:49:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449876509] [2023-08-03 17:49:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:55,008 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 17:49:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449876509] [2023-08-03 17:49:55,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449876509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:49:55,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:49:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:49:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109214132] [2023-08-03 17:49:55,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:49:55,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:49:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:49:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:49:55,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 215 [2023-08-03 17:49:55,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 17:49:55,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:55,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 215 [2023-08-03 17:49:55,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:56,421 INFO L124 PetriNetUnfolderBase]: 16282/23101 cut-off events. [2023-08-03 17:49:56,421 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2023-08-03 17:49:56,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45423 conditions, 23101 events. 16282/23101 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 133898 event pairs, 3786 based on Foata normal form. 0/20076 useless extension candidates. Maximal degree in co-relation 12037. Up to 20801 conditions per place. [2023-08-03 17:49:56,507 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 47 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 17:49:56,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 254 flow [2023-08-03 17:49:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:49:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:49:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-03 17:49:56,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5395348837209303 [2023-08-03 17:49:56,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-03 17:49:56,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-03 17:49:56,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:56,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-03 17:49:56,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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 17:49:56,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:56,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:56,510 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 115 flow. Second operand 3 states and 348 transitions. [2023-08-03 17:49:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 254 flow [2023-08-03 17:49:56,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:49:56,512 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 131 flow [2023-08-03 17:49:56,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 17:49:56,512 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-03 17:49:56,513 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 131 flow [2023-08-03 17:49:56,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 17:49:56,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:56,513 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:49:56,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:49:56,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:56,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1171118167, now seen corresponding path program 1 times [2023-08-03 17:49:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79744816] [2023-08-03 17:49:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:56,545 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 17:49:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79744816] [2023-08-03 17:49:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79744816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:49:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:49:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:49:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181575804] [2023-08-03 17:49:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:49:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:49:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:49:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:49:56,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-08-03 17:49:56,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 17:49:56,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:56,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-08-03 17:49:56,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:58,052 INFO L124 PetriNetUnfolderBase]: 16138/22557 cut-off events. [2023-08-03 17:49:58,053 INFO L125 PetriNetUnfolderBase]: For 1574/1574 co-relation queries the response was YES. [2023-08-03 17:49:58,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47868 conditions, 22557 events. 16138/22557 cut-off events. For 1574/1574 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 128441 event pairs, 12146 based on Foata normal form. 0/19372 useless extension candidates. Maximal degree in co-relation 12637. Up to 21409 conditions per place. [2023-08-03 17:49:58,158 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 45 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 17:49:58,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 252 flow [2023-08-03 17:49:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:49:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:49:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-03 17:49:58,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517829457364341 [2023-08-03 17:49:58,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-03 17:49:58,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-03 17:49:58,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:58,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-03 17:49:58,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:49:58,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:58,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 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 17:49:58,169 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 131 flow. Second operand 3 states and 334 transitions. [2023-08-03 17:49:58,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 252 flow [2023-08-03 17:49:58,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:49:58,171 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 142 flow [2023-08-03 17:49:58,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-03 17:49:58,172 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2023-08-03 17:49:58,172 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 142 flow [2023-08-03 17:49:58,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 17:49:58,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:58,173 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:49:58,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:49:58,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:49:58,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash -684669309, now seen corresponding path program 1 times [2023-08-03 17:49:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893872867] [2023-08-03 17:49:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:49:58,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:49:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:49:58,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:49:58,218 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:49:58,218 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-03 17:49:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:49:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:49:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:49:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:49:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:49:58,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:49:58,219 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:49:58,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:49:58,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:49:58,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:49:58 BasicIcfg [2023-08-03 17:49:58,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:49:58,278 INFO L158 Benchmark]: Toolchain (without parser) took 17414.97ms. Allocated memory was 434.1MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 390.8MB in the beginning and 1.3GB in the end (delta: -907.1MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-03 17:49:58,278 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 434.1MB. Free memory is still 382.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:49:58,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.88ms. Allocated memory is still 434.1MB. Free memory was 390.4MB in the beginning and 366.1MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:49:58,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.85ms. Allocated memory is still 434.1MB. Free memory was 366.1MB in the beginning and 363.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:49:58,278 INFO L158 Benchmark]: Boogie Preprocessor took 44.18ms. Allocated memory is still 434.1MB. Free memory was 363.5MB in the beginning and 361.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:49:58,278 INFO L158 Benchmark]: RCFGBuilder took 560.01ms. Allocated memory was 434.1MB in the beginning and 654.3MB in the end (delta: 220.2MB). Free memory was 361.4MB in the beginning and 613.9MB in the end (delta: -252.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.0GB. [2023-08-03 17:49:58,279 INFO L158 Benchmark]: TraceAbstraction took 16350.90ms. Allocated memory was 654.3MB in the beginning and 2.8GB in the end (delta: 2.2GB). Free memory was 612.8MB in the beginning and 1.3GB in the end (delta: -685.1MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-03 17:49:58,279 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 434.1MB. Free memory is still 382.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 401.88ms. Allocated memory is still 434.1MB. Free memory was 390.4MB in the beginning and 366.1MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.85ms. Allocated memory is still 434.1MB. Free memory was 366.1MB in the beginning and 363.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.18ms. Allocated memory is still 434.1MB. Free memory was 363.5MB in the beginning and 361.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 560.01ms. Allocated memory was 434.1MB in the beginning and 654.3MB in the end (delta: 220.2MB). Free memory was 361.4MB in the beginning and 613.9MB in the end (delta: -252.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.0GB. * TraceAbstraction took 16350.90ms. Allocated memory was 654.3MB in the beginning and 2.8GB in the end (delta: 2.2GB). Free memory was 612.8MB in the beginning and 1.3GB in the end (delta: -685.1MB). Peak memory consumption was 1.5GB. 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.4s, 104 PlacesBefore, 30 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1398 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 90 TotalNumberOfCompositions, 3391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1784, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 730, independent conditional: 0, independent unconditional: 730, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1784, independent: 929, independent conditional: 0, independent unconditional: 929, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 754, unknown conditional: 0, unknown unconditional: 754] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 125 PlacesBefore, 47 PlacesAfterwards, 120 TransitionsBefore, 39 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 9016 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3177, independent: 2970, independent conditional: 0, independent unconditional: 2970, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1593, independent: 1551, independent conditional: 0, independent unconditional: 1551, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3177, independent: 1419, independent conditional: 0, independent unconditional: 1419, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1593, unknown conditional: 0, unknown unconditional: 1593] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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; [L823] 0 pthread_t t1761[2]; [L824] 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, t1761={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] [L824] COND TRUE 0 asdf<2 [L824] FCALL, FORK 0 pthread_create(&t1761[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(&t1761[asdf], ((void *)0), P0, ((void *)0))=-3, t1761={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] [L824] 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, t1761={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] [L824] COND TRUE 0 asdf<2 [L824] FCALL, FORK 0 pthread_create(&t1761[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(&t1761[asdf], ((void *)0), P0, ((void *)0))=-2, t1761={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] [L824] 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, t1761={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] [L824] COND FALSE 0 !(asdf<2) [L825] 0 pthread_t t1762[2]; [L826] 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, t1761={5:0}, t1762={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] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t1762[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(&t1762[asdf], ((void *)0), P1, ((void *)0))=-1, t1761={5:0}, t1762={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] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, t1762={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=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] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t1762[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=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762[asdf], ((void *)0), P1, ((void *)0))=0, t1761={5:0}, t1762={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=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] [L771] 4 y$w_buff1 = y$w_buff0 [L772] 4 y$w_buff0 = 1 [L773] 4 y$w_buff1_used = y$w_buff0_used [L774] 4 y$w_buff0_used = (_Bool)1 [L775] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __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=1, 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 5 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: 3.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 53 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=68occurred 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, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 2 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 18, 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.3s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 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 17:49:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...