/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/weaver_test-easy6.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:10:11,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:10:11,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:10:11,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:10:11,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:10:11,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:10:11,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:10:11,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:10:11,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:10:11,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:10:11,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:10:11,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:10:11,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:10:11,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:10:11,300 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:10:11,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:10:11,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:10:11,300 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:10:11,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:10:11,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:10:11,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:10:11,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:10:11,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:10:11,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:10:11,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:10:11,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:10:11,303 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:10:11,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:10:11,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:10:11,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:10:11,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:10:11,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:10:11,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:10:11,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:10:11,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:10:11,306 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:10:11,306 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 21:10:11,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:10:11,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:10:11,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:10:11,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:10:11,545 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:10:11,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-03 21:10:12,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:10:12,875 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:10:12,876 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c [2023-08-03 21:10:12,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b45fa6f/d2a045494de24f26be48639be591bcd8/FLAGe08b92693 [2023-08-03 21:10:12,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b45fa6f/d2a045494de24f26be48639be591bcd8 [2023-08-03 21:10:12,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:10:12,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:10:12,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:10:12,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:10:12,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:10:12,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:10:12" (1/1) ... [2023-08-03 21:10:12,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c274793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:12, skipping insertion in model container [2023-08-03 21:10:12,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:10:12" (1/1) ... [2023-08-03 21:10:12,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:10:13,078 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c[3208,3221] [2023-08-03 21:10:13,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:10:13,087 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:10:13,106 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_test-easy6.wvr_bound2.c[3208,3221] [2023-08-03 21:10:13,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:10:13,113 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:10:13,114 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 21:10:13,119 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:10:13,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13 WrapperNode [2023-08-03 21:10:13,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:10:13,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:10:13,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:10:13,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:10:13,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,160 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-08-03 21:10:13,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:10:13,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:10:13,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:10:13,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:10:13,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:10:13,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:10:13,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:10:13,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:10:13,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (1/1) ... [2023-08-03 21:10:13,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:10:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:13,214 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 21:10:13,246 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 21:10:13,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:10:13,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 21:10:13,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 21:10:13,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 21:10:13,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 21:10:13,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:10:13,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:10:13,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:10:13,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 21:10:13,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 21:10:13,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:10:13,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:10:13,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:10:13,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:10:13,266 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 21:10:13,366 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:10:13,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:10:13,582 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:10:13,622 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:10:13,622 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-03 21:10:13,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:10:13 BoogieIcfgContainer [2023-08-03 21:10:13,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:10:13,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:10:13,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:10:13,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:10:13,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:10:12" (1/3) ... [2023-08-03 21:10:13,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4602d24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:10:13, skipping insertion in model container [2023-08-03 21:10:13,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:10:13" (2/3) ... [2023-08-03 21:10:13,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4602d24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:10:13, skipping insertion in model container [2023-08-03 21:10:13,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:10:13" (3/3) ... [2023-08-03 21:10:13,632 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_test-easy6.wvr_bound2.c [2023-08-03 21:10:13,639 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:10:13,648 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:10:13,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:10:13,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:10:13,719 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 21:10:13,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 238 flow [2023-08-03 21:10:13,852 INFO L124 PetriNetUnfolderBase]: 26/249 cut-off events. [2023-08-03 21:10:13,852 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-08-03 21:10:13,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 249 events. 26/249 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 965 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2023-08-03 21:10:13,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 238 flow [2023-08-03 21:10:13,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 222 flow [2023-08-03 21:10:13,865 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:10:13,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 100 transitions, 222 flow [2023-08-03 21:10:13,876 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 100 transitions, 222 flow [2023-08-03 21:10:13,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 222 flow [2023-08-03 21:10:13,909 INFO L124 PetriNetUnfolderBase]: 26/217 cut-off events. [2023-08-03 21:10:13,909 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-08-03 21:10:13,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 217 events. 26/217 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 737 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-03 21:10:13,913 INFO L119 LiptonReduction]: Number of co-enabled transitions 2310 [2023-08-03 21:10:15,608 INFO L134 LiptonReduction]: Checked pairs total: 9177 [2023-08-03 21:10:15,609 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-03 21:10:15,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:10:15,627 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;@287ddde0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:10:15,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:10:15,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:10:15,631 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 21:10:15,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:10:15,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:15,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 21:10:15,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:15,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 419802906, now seen corresponding path program 1 times [2023-08-03 21:10:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935325701] [2023-08-03 21:10:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:15,849 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 21:10:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935325701] [2023-08-03 21:10:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935325701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:10:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:10:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13291532] [2023-08-03 21:10:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:15,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:10:15,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 176 [2023-08-03 21:10:15,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 21:10:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 176 [2023-08-03 21:10:15,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:16,054 INFO L124 PetriNetUnfolderBase]: 249/614 cut-off events. [2023-08-03 21:10:16,055 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-03 21:10:16,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 614 events. 249/614 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3672 event pairs, 231 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 952. Up to 457 conditions per place. [2023-08-03 21:10:16,060 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 27 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-03 21:10:16,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 170 flow [2023-08-03 21:10:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-03 21:10:16,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2023-08-03 21:10:16,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-03 21:10:16,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-03 21:10:16,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:16,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-03 21:10:16,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 21:10:16,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 21:10:16,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 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 21:10:16,087 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 104 flow. Second operand 3 states and 294 transitions. [2023-08-03 21:10:16,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 170 flow [2023-08-03 21:10:16,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:10:16,092 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 112 flow [2023-08-03 21:10:16,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-03 21:10:16,096 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 21:10:16,097 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 112 flow [2023-08-03 21:10:16,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 21:10:16,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:16,097 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 21:10:16,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:10:16,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:16,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash 152781749, now seen corresponding path program 1 times [2023-08-03 21:10:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:16,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94905288] [2023-08-03 21:10:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:16,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:10:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:16,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:10:16,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:10:16,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 21:10:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 21:10:16,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:10:16,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 21:10:16,146 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 21:10:16,149 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:10:16,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:10:16,171 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 21:10:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 320 flow [2023-08-03 21:10:16,247 INFO L124 PetriNetUnfolderBase]: 117/829 cut-off events. [2023-08-03 21:10:16,248 INFO L125 PetriNetUnfolderBase]: For 72/79 co-relation queries the response was YES. [2023-08-03 21:10:16,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 829 events. 117/829 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4554 event pairs, 2 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 484. Up to 32 conditions per place. [2023-08-03 21:10:16,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 320 flow [2023-08-03 21:10:16,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 128 transitions, 304 flow [2023-08-03 21:10:16,255 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:10:16,255 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 128 transitions, 304 flow [2023-08-03 21:10:16,256 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 128 transitions, 304 flow [2023-08-03 21:10:16,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 128 transitions, 304 flow [2023-08-03 21:10:16,311 INFO L124 PetriNetUnfolderBase]: 117/701 cut-off events. [2023-08-03 21:10:16,311 INFO L125 PetriNetUnfolderBase]: For 72/79 co-relation queries the response was YES. [2023-08-03 21:10:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 701 events. 117/701 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3644 event pairs, 2 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 420. Up to 32 conditions per place. [2023-08-03 21:10:16,326 INFO L119 LiptonReduction]: Number of co-enabled transitions 6028 [2023-08-03 21:10:17,907 INFO L134 LiptonReduction]: Checked pairs total: 32490 [2023-08-03 21:10:17,907 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-03 21:10:17,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:10:17,910 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;@287ddde0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:10:17,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:10:17,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:10:17,913 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 21:10:17,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:10:17,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:17,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 21:10:17,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:17,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash 641202534, now seen corresponding path program 1 times [2023-08-03 21:10:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429251653] [2023-08-03 21:10:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:17,948 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 21:10:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429251653] [2023-08-03 21:10:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429251653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:10:17,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:10:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339399240] [2023-08-03 21:10:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:17,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:17,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:17,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:10:17,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-03 21:10:17,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 21:10:17,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:17,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-03 21:10:17,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:20,107 INFO L124 PetriNetUnfolderBase]: 12819/21889 cut-off events. [2023-08-03 21:10:20,108 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2023-08-03 21:10:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41285 conditions, 21889 events. 12819/21889 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 190422 event pairs, 8831 based on Foata normal form. 0/19360 useless extension candidates. Maximal degree in co-relation 10817. Up to 17979 conditions per place. [2023-08-03 21:10:20,327 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 40 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-03 21:10:20,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 276 flow [2023-08-03 21:10:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-03 21:10:20,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841423948220065 [2023-08-03 21:10:20,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-03 21:10:20,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-03 21:10:20,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:20,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-03 21:10:20,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 21:10:20,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:20,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:20,340 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 182 flow. Second operand 3 states and 361 transitions. [2023-08-03 21:10:20,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 276 flow [2023-08-03 21:10:20,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:10:20,347 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 194 flow [2023-08-03 21:10:20,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-03 21:10:20,348 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:10:20,348 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 194 flow [2023-08-03 21:10:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 21:10:20,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:20,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:20,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:10:20,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:20,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash -321115124, now seen corresponding path program 1 times [2023-08-03 21:10:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:20,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694572526] [2023-08-03 21:10:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:20,448 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 21:10:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694572526] [2023-08-03 21:10:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694572526] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051915973] [2023-08-03 21:10:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:20,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:20,461 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 21:10:20,496 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 21:10:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:20,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:10:20,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:10:20,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051915973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:10:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478596013] [2023-08-03 21:10:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:20,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-03 21:10:20,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 21:10:20,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:20,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-03 21:10:20,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:22,419 INFO L124 PetriNetUnfolderBase]: 12799/21491 cut-off events. [2023-08-03 21:10:22,419 INFO L125 PetriNetUnfolderBase]: For 1982/1982 co-relation queries the response was YES. [2023-08-03 21:10:22,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40938 conditions, 21491 events. 12799/21491 cut-off events. For 1982/1982 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 184270 event pairs, 11827 based on Foata normal form. 0/19120 useless extension candidates. Maximal degree in co-relation 31660. Up to 17683 conditions per place. [2023-08-03 21:10:22,555 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 47 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-03 21:10:22,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 314 flow [2023-08-03 21:10:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-03 21:10:22,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938511326860841 [2023-08-03 21:10:22,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-03 21:10:22,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-03 21:10:22,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:22,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-03 21:10:22,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 21:10:22,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:22,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:22,561 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 194 flow. Second operand 3 states and 367 transitions. [2023-08-03 21:10:22,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 314 flow [2023-08-03 21:10:22,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:10:22,570 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 204 flow [2023-08-03 21:10:22,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-03 21:10:22,572 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 21:10:22,572 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 204 flow [2023-08-03 21:10:22,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 21:10:22,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:22,573 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 21:10:22,581 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 21:10:22,781 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 21:10:22,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:22,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1370951206, now seen corresponding path program 1 times [2023-08-03 21:10:22,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:22,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563665218] [2023-08-03 21:10:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:22,867 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 21:10:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563665218] [2023-08-03 21:10:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563665218] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236704137] [2023-08-03 21:10:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:22,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:22,870 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 21:10:22,873 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 21:10:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:22,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:10:22,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:22,964 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 21:10:22,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:22,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236704137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:22,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:22,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 21:10:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301580153] [2023-08-03 21:10:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:22,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:10:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:22,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 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 21:10:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:22,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:24,544 INFO L124 PetriNetUnfolderBase]: 12775/21573 cut-off events. [2023-08-03 21:10:24,544 INFO L125 PetriNetUnfolderBase]: For 2792/2792 co-relation queries the response was YES. [2023-08-03 21:10:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41837 conditions, 21573 events. 12775/21573 cut-off events. For 2792/2792 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 186002 event pairs, 8812 based on Foata normal form. 16/19524 useless extension candidates. Maximal degree in co-relation 10811. Up to 17876 conditions per place. [2023-08-03 21:10:24,678 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 46 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2023-08-03 21:10:24,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 325 flow [2023-08-03 21:10:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:10:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:10:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-03 21:10:24,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.558252427184466 [2023-08-03 21:10:24,680 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-03 21:10:24,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-03 21:10:24,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:24,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-03 21:10:24,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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 21:10:24,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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 21:10:24,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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 21:10:24,685 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 204 flow. Second operand 5 states and 575 transitions. [2023-08-03 21:10:24,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 325 flow [2023-08-03 21:10:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:10:24,698 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 213 flow [2023-08-03 21:10:24,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-03 21:10:24,700 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2023-08-03 21:10:24,700 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 213 flow [2023-08-03 21:10:24,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 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 21:10:24,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:24,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:24,712 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 21:10:24,905 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 21:10:24,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:24,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1218496986, now seen corresponding path program 1 times [2023-08-03 21:10:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:24,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256171378] [2023-08-03 21:10:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:10:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256171378] [2023-08-03 21:10:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256171378] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499033227] [2023-08-03 21:10:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:24,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:24,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 21:10:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:25,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:10:25,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:10:25,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499033227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 21:10:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172484596] [2023-08-03 21:10:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:25,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:25,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-03 21:10:25,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 21:10:25,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:25,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-03 21:10:25,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:26,271 INFO L124 PetriNetUnfolderBase]: 10349/17489 cut-off events. [2023-08-03 21:10:26,271 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2023-08-03 21:10:26,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34340 conditions, 17489 events. 10349/17489 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 147111 event pairs, 7219 based on Foata normal form. 0/16035 useless extension candidates. Maximal degree in co-relation 18191. Up to 10829 conditions per place. [2023-08-03 21:10:26,360 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 56 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:10:26,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 375 flow [2023-08-03 21:10:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-03 21:10:26,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-03 21:10:26,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-03 21:10:26,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-03 21:10:26,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:26,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-03 21:10:26,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 21:10:26,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:26,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:26,365 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 213 flow. Second operand 3 states and 374 transitions. [2023-08-03 21:10:26,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 375 flow [2023-08-03 21:10:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 368 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:10:26,370 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 218 flow [2023-08-03 21:10:26,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2023-08-03 21:10:26,373 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2023-08-03 21:10:26,373 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 218 flow [2023-08-03 21:10:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 21:10:26,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:26,373 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:26,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:26,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:26,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1260153058, now seen corresponding path program 1 times [2023-08-03 21:10:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013480279] [2023-08-03 21:10:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013480279] [2023-08-03 21:10:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013480279] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987396737] [2023-08-03 21:10:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:26,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:26,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:26,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:26,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 21:10:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:26,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:10:26,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:26,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:10:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:26,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987396737] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:10:26,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:10:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:10:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724488402] [2023-08-03 21:10:26,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:10:26,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:26,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:26,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 21:10:26,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:26,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:26,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:27,834 INFO L124 PetriNetUnfolderBase]: 9453/15527 cut-off events. [2023-08-03 21:10:27,834 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2023-08-03 21:10:27,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32140 conditions, 15527 events. 9453/15527 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 124429 event pairs, 6721 based on Foata normal form. 4/14736 useless extension candidates. Maximal degree in co-relation 11184. Up to 13459 conditions per place. [2023-08-03 21:10:27,916 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 47 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-03 21:10:27,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 332 flow [2023-08-03 21:10:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:10:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:10:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-08-03 21:10:27,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691747572815534 [2023-08-03 21:10:27,922 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-08-03 21:10:27,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-08-03 21:10:27,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:27,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-08-03 21:10:27,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 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 21:10:27,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:27,930 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:27,930 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 218 flow. Second operand 4 states and 469 transitions. [2023-08-03 21:10:27,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 332 flow [2023-08-03 21:10:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:10:27,949 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 214 flow [2023-08-03 21:10:27,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2023-08-03 21:10:27,950 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2023-08-03 21:10:27,950 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 214 flow [2023-08-03 21:10:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 21:10:27,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:27,951 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:27,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:28,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:28,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:28,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1196686363, now seen corresponding path program 1 times [2023-08-03 21:10:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:28,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621052748] [2023-08-03 21:10:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:10:28,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621052748] [2023-08-03 21:10:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621052748] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378688946] [2023-08-03 21:10:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:28,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:28,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:28,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:28,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 21:10:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:28,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:10:28,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:10:28,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378688946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:28,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:10:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870342276] [2023-08-03 21:10:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:10:28,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:28,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 21:10:28,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:28,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:29,521 INFO L124 PetriNetUnfolderBase]: 8685/14225 cut-off events. [2023-08-03 21:10:29,521 INFO L125 PetriNetUnfolderBase]: For 2751/2751 co-relation queries the response was YES. [2023-08-03 21:10:29,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29403 conditions, 14225 events. 8685/14225 cut-off events. For 2751/2751 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 111598 event pairs, 3658 based on Foata normal form. 256/13893 useless extension candidates. Maximal degree in co-relation 18021. Up to 10906 conditions per place. [2023-08-03 21:10:29,578 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 65 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2023-08-03 21:10:29,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 97 transitions, 408 flow [2023-08-03 21:10:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:10:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:10:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-03 21:10:29,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757281553398058 [2023-08-03 21:10:29,580 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-03 21:10:29,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-03 21:10:29,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:29,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-03 21:10:29,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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 21:10:29,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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 21:10:29,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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 21:10:29,584 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 214 flow. Second operand 5 states and 593 transitions. [2023-08-03 21:10:29,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 97 transitions, 408 flow [2023-08-03 21:10:29,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 21:10:29,592 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 219 flow [2023-08-03 21:10:29,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2023-08-03 21:10:29,593 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2023-08-03 21:10:29,593 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 219 flow [2023-08-03 21:10:29,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 21:10:29,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:29,594 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:29,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:29,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:29,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:29,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1460058873, now seen corresponding path program 1 times [2023-08-03 21:10:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913701807] [2023-08-03 21:10:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 21:10:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913701807] [2023-08-03 21:10:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913701807] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983992904] [2023-08-03 21:10:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:29,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:29,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:29,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 21:10:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:29,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:10:29,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:29,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:10:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983992904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:10:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:10:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 21:10:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003770038] [2023-08-03 21:10:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:10:29,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:10:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:10:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:29,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-03 21:10:29,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 21:10:29,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:29,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-03 21:10:29,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:30,962 INFO L124 PetriNetUnfolderBase]: 8372/13796 cut-off events. [2023-08-03 21:10:30,962 INFO L125 PetriNetUnfolderBase]: For 4819/4819 co-relation queries the response was YES. [2023-08-03 21:10:30,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29460 conditions, 13796 events. 8372/13796 cut-off events. For 4819/4819 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 108948 event pairs, 6508 based on Foata normal form. 0/13292 useless extension candidates. Maximal degree in co-relation 18149. Up to 9555 conditions per place. [2023-08-03 21:10:31,013 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 57 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:10:31,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 381 flow [2023-08-03 21:10:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:10:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:10:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-03 21:10:31,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6051779935275081 [2023-08-03 21:10:31,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-03 21:10:31,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-03 21:10:31,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:31,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-03 21:10:31,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 21:10:31,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:31,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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 21:10:31,021 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 219 flow. Second operand 3 states and 374 transitions. [2023-08-03 21:10:31,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 381 flow [2023-08-03 21:10:31,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 374 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:10:31,033 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 224 flow [2023-08-03 21:10:31,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-08-03 21:10:31,034 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-03 21:10:31,034 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 224 flow [2023-08-03 21:10:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 21:10:31,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:31,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:31,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:31,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:31,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:31,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -232244704, now seen corresponding path program 1 times [2023-08-03 21:10:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247903307] [2023-08-03 21:10:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247903307] [2023-08-03 21:10:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247903307] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184669931] [2023-08-03 21:10:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:31,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:31,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:31,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 21:10:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:31,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:10:31,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:31,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:10:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:10:31,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184669931] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:10:31,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:10:31,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:10:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024024225] [2023-08-03 21:10:31,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:10:31,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:31,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:31,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 21:10:31,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:31,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:31,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:32,374 INFO L124 PetriNetUnfolderBase]: 7964/13106 cut-off events. [2023-08-03 21:10:32,374 INFO L125 PetriNetUnfolderBase]: For 3988/3988 co-relation queries the response was YES. [2023-08-03 21:10:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28304 conditions, 13106 events. 7964/13106 cut-off events. For 3988/3988 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 101702 event pairs, 4426 based on Foata normal form. 64/12951 useless extension candidates. Maximal degree in co-relation 22166. Up to 10085 conditions per place. [2023-08-03 21:10:32,431 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 60 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2023-08-03 21:10:32,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 388 flow [2023-08-03 21:10:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:10:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:10:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-03 21:10:32,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5837378640776699 [2023-08-03 21:10:32,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-03 21:10:32,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-03 21:10:32,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:32,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-03 21:10:32,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:10:32,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:32,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:32,435 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 224 flow. Second operand 4 states and 481 transitions. [2023-08-03 21:10:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 388 flow [2023-08-03 21:10:32,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:10:32,511 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 220 flow [2023-08-03 21:10:32,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-08-03 21:10:32,512 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-03 21:10:32,512 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 220 flow [2023-08-03 21:10:32,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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 21:10:32,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:32,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:32,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:32,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:32,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2029884691, now seen corresponding path program 1 times [2023-08-03 21:10:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156502634] [2023-08-03 21:10:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:10:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156502634] [2023-08-03 21:10:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156502634] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:32,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787207596] [2023-08-03 21:10:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:32,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:32,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:32,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 21:10:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:32,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:10:32,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:10:32,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:10:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:10:32,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787207596] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:10:32,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:10:32,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:10:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578298323] [2023-08-03 21:10:32,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:10:32,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:32,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:32,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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 21:10:32,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:32,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:32,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:33,646 INFO L124 PetriNetUnfolderBase]: 6080/9960 cut-off events. [2023-08-03 21:10:33,646 INFO L125 PetriNetUnfolderBase]: For 4165/4165 co-relation queries the response was YES. [2023-08-03 21:10:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21745 conditions, 9960 events. 6080/9960 cut-off events. For 4165/4165 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 73796 event pairs, 2353 based on Foata normal form. 256/9881 useless extension candidates. Maximal degree in co-relation 20037. Up to 3564 conditions per place. [2023-08-03 21:10:33,692 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-03 21:10:33,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 430 flow [2023-08-03 21:10:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:10:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:10:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-03 21:10:33,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-03 21:10:33,694 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-03 21:10:33,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-03 21:10:33,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:33,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-03 21:10:33,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 21:10:33,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:33,696 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:33,696 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 220 flow. Second operand 4 states and 489 transitions. [2023-08-03 21:10:33,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 430 flow [2023-08-03 21:10:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:10:33,713 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 234 flow [2023-08-03 21:10:33,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2023-08-03 21:10:33,714 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2023-08-03 21:10:33,714 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 234 flow [2023-08-03 21:10:33,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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 21:10:33,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:33,714 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:33,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:33,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 21:10:33,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:33,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2139400116, now seen corresponding path program 1 times [2023-08-03 21:10:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096854370] [2023-08-03 21:10:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:10:33,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:10:33,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096854370] [2023-08-03 21:10:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096854370] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:10:33,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945039692] [2023-08-03 21:10:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:33,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:33,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:10:33,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:10:34,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 21:10:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:10:34,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:10:34,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:10:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:10:34,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:10:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 21:10:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945039692] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:10:34,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:10:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:10:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998144204] [2023-08-03 21:10:34,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:10:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:10:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:10:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:10:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:10:34,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 206 [2023-08-03 21:10:34,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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 21:10:34,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:10:34,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 206 [2023-08-03 21:10:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:10:34,935 INFO L124 PetriNetUnfolderBase]: 6068/10165 cut-off events. [2023-08-03 21:10:34,936 INFO L125 PetriNetUnfolderBase]: For 6106/6106 co-relation queries the response was YES. [2023-08-03 21:10:34,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23417 conditions, 10165 events. 6068/10165 cut-off events. For 6106/6106 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 76841 event pairs, 5681 based on Foata normal form. 17/9811 useless extension candidates. Maximal degree in co-relation 21665. Up to 8085 conditions per place. [2023-08-03 21:10:34,993 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 67 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-03 21:10:34,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 446 flow [2023-08-03 21:10:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:10:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:10:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-03 21:10:34,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934466019417476 [2023-08-03 21:10:34,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-03 21:10:34,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-03 21:10:34,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:10:34,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-03 21:10:34,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 21:10:34,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:34,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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 21:10:34,998 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 234 flow. Second operand 4 states and 489 transitions. [2023-08-03 21:10:34,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 446 flow [2023-08-03 21:10:35,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 100 transitions, 442 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:10:35,030 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 238 flow [2023-08-03 21:10:35,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-03 21:10:35,030 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-03 21:10:35,030 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 238 flow [2023-08-03 21:10:35,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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 21:10:35,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:10:35,031 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:35,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 21:10:35,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:10:35,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:10:35,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:10:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1654979727, now seen corresponding path program 1 times [2023-08-03 21:10:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:10:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694509538] [2023-08-03 21:10:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:10:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:10:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:35,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:10:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:10:35,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:10:35,319 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:10:35,319 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-03 21:10:35,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 21:10:35,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:10:35,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 21:10:35,320 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:10:35,323 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:10:35,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:10:35,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:10:35 BasicIcfg [2023-08-03 21:10:35,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:10:35,431 INFO L158 Benchmark]: Toolchain (without parser) took 22525.28ms. Allocated memory was 671.1MB in the beginning and 9.3GB in the end (delta: 8.7GB). Free memory was 619.5MB in the beginning and 7.6GB in the end (delta: -7.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-03 21:10:35,431 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 377.5MB. Free memory was 326.5MB in the beginning and 326.3MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:10:35,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.31ms. Allocated memory is still 671.1MB. Free memory was 619.1MB in the beginning and 607.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-03 21:10:35,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.23ms. Allocated memory is still 671.1MB. Free memory was 607.8MB in the beginning and 605.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:10:35,432 INFO L158 Benchmark]: Boogie Preprocessor took 22.15ms. Allocated memory is still 671.1MB. Free memory was 605.8MB in the beginning and 604.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:10:35,433 INFO L158 Benchmark]: RCFGBuilder took 440.58ms. Allocated memory is still 671.1MB. Free memory was 604.4MB in the beginning and 587.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-03 21:10:35,433 INFO L158 Benchmark]: TraceAbstraction took 21804.66ms. Allocated memory was 671.1MB in the beginning and 9.3GB in the end (delta: 8.7GB). Free memory was 586.6MB in the beginning and 7.6GB in the end (delta: -7.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-03 21:10:35,435 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.12ms. Allocated memory is still 377.5MB. Free memory was 326.5MB in the beginning and 326.3MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 211.31ms. Allocated memory is still 671.1MB. Free memory was 619.1MB in the beginning and 607.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.23ms. Allocated memory is still 671.1MB. Free memory was 607.8MB in the beginning and 605.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.15ms. Allocated memory is still 671.1MB. Free memory was 605.8MB in the beginning and 604.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 440.58ms. Allocated memory is still 671.1MB. Free memory was 604.4MB in the beginning and 587.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 21804.66ms. Allocated memory was 671.1MB in the beginning and 9.3GB in the end (delta: 8.7GB). Free memory was 586.6MB in the beginning and 7.6GB in the end (delta: -7.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 96 PlacesBefore, 42 PlacesAfterwards, 100 TransitionsBefore, 41 TransitionsAfterwards, 2310 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 68 TotalNumberOfCompositions, 9177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4295, independent: 4083, independent conditional: 0, independent unconditional: 4083, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1142, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4295, independent: 2965, independent conditional: 0, independent unconditional: 2965, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1142, unknown conditional: 0, unknown unconditional: 1142] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 236, Positive conditional cache size: 0, Positive unconditional cache size: 236, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 124 PlacesBefore, 68 PlacesAfterwards, 128 TransitionsBefore, 67 TransitionsAfterwards, 6028 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 70 TotalNumberOfCompositions, 32490 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9550, independent: 9130, independent conditional: 0, independent unconditional: 9130, dependent: 420, dependent conditional: 0, dependent unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2417, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9550, independent: 6758, independent conditional: 0, independent unconditional: 6758, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 2417, unknown conditional: 0, unknown unconditional: 2417] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 502, Positive conditional cache size: 0, Positive unconditional cache size: 502, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 116]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, tmp1, tmp2, i, i1, i2; [L107] 0 pthread_t t1[2], t2[2]; [L110] 0 int asdf=0; VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=0, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-3, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L44] 1 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L47] 1 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L50] 1 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 1 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] COND TRUE 0 asdf<2 [L110] FCALL, FORK 0 pthread_create(&t1[asdf], 0, thread1, 0) VAL [asdf=1, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, pthread_create(&t1[asdf], 0, thread1, 0)=-2, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L44] 2 e1 = 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L47] 2 tmp1 = n2 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L50] 2 n1 = tmp1 + 1 VAL [e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 2 e1 = 0 VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] CALL 2 assume_abort_if_not(!e2) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(!e2) [L110] 0 asdf++ VAL [asdf=2, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L59] CALL 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 1 !(!cond) [L59] RET 1 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 1 i1 = i VAL [e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L65] 1 i = i1 + 1 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=1, n2=0, tmp1=0, tmp2=0] [L68] 1 n1 = 0 [L71] 1 return 0; [L110] COND FALSE 0 !(asdf<2) [L111] 0 int asdf=0; VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=0, asdf=2, e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=0, pthread_create(&t2[asdf], 0, thread2, 0)=-1, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L76] 3 e2 = 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L79] 3 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=0, tmp1=0, tmp2=0] [L82] 3 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 3 e2 = 0 VAL [e1=0, e2=0, i=0, i=0, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 3 assume_abort_if_not(!e1) [L35] COND FALSE 3 !(!cond) [L88] RET 3 assume_abort_if_not(!e1) [L59] CALL 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L35] COND FALSE 2 !(!cond) [L59] RET 2 assume_abort_if_not(n2 == 0 || n2 >= n1) [L62] 2 i1 = i VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=1, n1=0, n2=1, tmp1=0, tmp2=0] [L65] 2 i = i1 + 1 VAL [\result={0:0}, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L68] 2 n1 = 0 [L71] 2 return 0; [L111] 0 asdf++ VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L111] COND TRUE 0 asdf<2 [L111] FCALL, FORK 0 pthread_create(&t2[asdf], 0, thread2, 0) VAL [asdf=1, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, pthread_create(&t2[asdf], 0, thread2, 0)=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L76] 4 e2 = 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L79] 4 tmp2 = n1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L82] 4 n2 = tmp2 + 1 VAL [e1=0, e2=1, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L85] 4 e2 = 0 VAL [e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L88] CALL 4 assume_abort_if_not(!e1) [L35] COND FALSE 4 !(!cond) [L88] RET 4 assume_abort_if_not(!e1) [L111] 0 asdf++ VAL [asdf=2, asdf=2, e1=0, e2=0, i=0, i=1, i=2, n1=0, n2=1, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L91] CALL 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 3 !(!cond) [L91] RET 3 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 3 i2 = i VAL [e1=0, e2=0, i=1, i=2, i=2, n1=0, n2=1, tmp1=0, tmp2=0] [L97] 3 i = i2 + 1 VAL [e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=1, tmp1=0, tmp2=0] [L100] 3 n2 = 0 [L103] 3 return 0; [L111] COND FALSE 0 !(asdf<2) [L112] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=2, i=3, n1=0, n2=0, t1={3:0}, t1[asdf]=-3, t2={5:0}, tmp1=0, tmp2=0] [L91] CALL 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L35] COND FALSE 4 !(!cond) [L91] RET 4 assume_abort_if_not(n1 == 0 || n1 > n2) [L94] 4 i2 = i VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=3, n1=0, n2=0, tmp1=0, tmp2=0] [L97] 4 i = i2 + 1 VAL [\result={0:0}, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, tmp1=0, tmp2=0] [L100] 4 n2 = 0 [L103] 4 return 0; [L112] FCALL, JOIN 1 pthread_join(t1[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=-3, t2={5:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND TRUE 0 asdf<2 [L112] 0 t1[asdf] VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=-2, t2={5:0}, tmp1=0, tmp2=0] [L112] FCALL, JOIN 2 pthread_join(t1[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t1[asdf]=-2, t2={5:0}, tmp1=0, tmp2=0] [L112] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L112] COND FALSE 0 !(asdf<2) [L113] 0 int asdf=0; VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=-1, tmp1=0, tmp2=0] [L113] FCALL, JOIN 3 pthread_join(t2[asdf], 0) VAL [asdf=0, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=-1, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND TRUE 0 asdf<2 [L113] 0 t2[asdf] VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=0, tmp1=0, tmp2=0] [L113] FCALL, JOIN 4 pthread_join(t2[asdf], 0) VAL [asdf=1, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, t2[asdf]=0, tmp1=0, tmp2=0] [L113] 0 asdf++ VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L113] COND FALSE 0 !(asdf<2) [L115] CALL 0 assume_abort_if_not(i != 2) [L35] COND FALSE 0 !(!cond) [L115] RET 0 assume_abort_if_not(i != 2) [L116] 0 reach_error() VAL [asdf=2, asdf=2, asdf=2, asdf=2, e1=0, e2=0, i=1, i=3, i=4, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] - UnprovableResult [Line: 110]: 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: 111]: 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, 124 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s 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, 60 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 60 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=112occurred 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, 148 locations, 3 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: 19.1s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1193 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 4 mSDtfsCounter, 1193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 399 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=10, InterpolantAutomatonStates: 38, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 191/216 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 21:10:35,469 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...