/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:10:49,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:10:49,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:10:49,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:10:49,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:10:49,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:10:49,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:10:49,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:10:49,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:10:49,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:10:49,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:10:49,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:10:49,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:10:49,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:10:49,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:10:49,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:10:49,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:10:49,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:10:49,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:10:49,640 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:10:49,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:10:49,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:10:49,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:10:49,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:10:49,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:10:49,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:10:49,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:10:49,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:10:49,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:10:49,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:10:49,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:10:49,643 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-03 23:10:49,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:10:49,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:10:49,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:10:49,846 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:10:49,847 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:10:49,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i [2023-08-03 23:10:50,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:10:51,037 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:10:51,038 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i [2023-08-03 23:10:51,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb81c0dde/936d60ff1f8f461a9796cabbf7bb353b/FLAG906abe10a [2023-08-03 23:10:51,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb81c0dde/936d60ff1f8f461a9796cabbf7bb353b [2023-08-03 23:10:51,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:10:51,063 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:10:51,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:10:51,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:10:51,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:10:51,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a3b5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51, skipping insertion in model container [2023-08-03 23:10:51,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,109 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:10:51,244 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i[945,958] [2023-08-03 23:10:51,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:10:51,407 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:10:51,414 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix009.oepc_bound2.i[945,958] [2023-08-03 23:10:51,434 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:10:51,435 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:10:51,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:10:51,480 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:10:51,480 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:10:51,484 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:10:51,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51 WrapperNode [2023-08-03 23:10:51,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:10:51,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:10:51,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:10:51,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:10:51,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,513 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-03 23:10:51,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:10:51,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:10:51,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:10:51,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:10:51,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:10:51,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:10:51,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:10:51,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:10:51,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (1/1) ... [2023-08-03 23:10:51,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:10:51,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:10:51,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 23:10:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 23:10:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:10:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:10:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:10:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:10:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:10:51,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:10:51,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:10:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:10:51,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:10:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:10:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:10:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:10:51,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:10:51,591 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:10:51,673 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:10:51,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:10:51,928 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:10:52,041 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:10:52,041 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:10:52,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:10:52 BoogieIcfgContainer [2023-08-03 23:10:52,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:10:52,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:10:52,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:10:52,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:10:52,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:10:51" (1/3) ... [2023-08-03 23:10:52,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495aa181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:10:52, skipping insertion in model container [2023-08-03 23:10:52,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:10:51" (2/3) ... [2023-08-03 23:10:52,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495aa181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:10:52, skipping insertion in model container [2023-08-03 23:10:52,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:10:52" (3/3) ... [2023-08-03 23:10:52,049 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix009.oepc_bound2.i [2023-08-03 23:10:52,054 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:10:52,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:10:52,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:10:52,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:10:52,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:10:52,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 226 flow [2023-08-03 23:10:52,190 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 23:10:52,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:10:52,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2023-08-03 23:10:52,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 226 flow [2023-08-03 23:10:52,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 81 transitions, 172 flow [2023-08-03 23:10:52,199 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:10:52,208 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 81 transitions, 172 flow [2023-08-03 23:10:52,210 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 81 transitions, 172 flow [2023-08-03 23:10:52,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 172 flow [2023-08-03 23:10:52,234 INFO L124 PetriNetUnfolderBase]: 2/116 cut-off events. [2023-08-03 23:10:52,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:10:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 168 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2023-08-03 23:10:52,236 INFO L119 LiptonReduction]: Number of co-enabled transitions 820 [2023-08-03 23:10:54,487 INFO L134 LiptonReduction]: Checked pairs total: 1587 [2023-08-03 23:10:54,487 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-03 23:10:54,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:10:54,504 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;@7c66eeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:10:54,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:10:54,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:10:54,508 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 23:10:54,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:10:54,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:54,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:10:54,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:54,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 434918825, now seen corresponding path program 1 times [2023-08-03 23:10:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414853425] [2023-08-03 23:10:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:10:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:10:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414853425] [2023-08-03 23:10:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414853425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:10:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:10:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:10:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045756573] [2023-08-03 23:10:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:10:54,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:10:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:10:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:10:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:10:54,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 176 [2023-08-03 23:10:54,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:54,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:10:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 176 [2023-08-03 23:10:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:10:54,806 INFO L124 PetriNetUnfolderBase]: 89/187 cut-off events. [2023-08-03 23:10:54,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:10:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 187 events. 89/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 661 event pairs, 24 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 368. Up to 168 conditions per place. [2023-08-03 23:10:54,808 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-03 23:10:54,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 102 flow [2023-08-03 23:10:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:10:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:10:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-03 23:10:54,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2023-08-03 23:10:54,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-03 23:10:54,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-03 23:10:54,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:10:54,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-03 23:10:54,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:54,824 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 23:10:54,825 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 23:10:54,826 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 296 transitions. [2023-08-03 23:10:54,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 102 flow [2023-08-03 23:10:54,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:10:54,828 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-03 23:10:54,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-03 23:10:54,831 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-03 23:10:54,831 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-03 23:10:54,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:54,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:54,832 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:10:54,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:10:54,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:54,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 586433140, now seen corresponding path program 1 times [2023-08-03 23:10:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121965088] [2023-08-03 23:10:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:10:54,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:10:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:10:54,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:10:54,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:10:54,866 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:10:54,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:10:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:10:54,868 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:10:54,870 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:10:54,871 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:10:54,871 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:10:54,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:10:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 280 flow [2023-08-03 23:10:54,931 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 23:10:54,931 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:10:54,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1945 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:10:54,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 128 transitions, 280 flow [2023-08-03 23:10:54,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 226 flow [2023-08-03 23:10:54,934 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:10:54,934 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 226 flow [2023-08-03 23:10:54,934 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 226 flow [2023-08-03 23:10:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 226 flow [2023-08-03 23:10:54,958 INFO L124 PetriNetUnfolderBase]: 3/217 cut-off events. [2023-08-03 23:10:54,958 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:10:54,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 217 events. 3/217 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 542 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 173. Up to 9 conditions per place. [2023-08-03 23:10:54,963 INFO L119 LiptonReduction]: Number of co-enabled transitions 2364 [2023-08-03 23:10:56,904 INFO L134 LiptonReduction]: Checked pairs total: 9192 [2023-08-03 23:10:56,904 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-03 23:10:56,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:10:56,906 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;@7c66eeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:10:56,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:10:56,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:10:56,910 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-08-03 23:10:56,910 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:10:56,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:56,910 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:10:56,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:56,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1353647744, now seen corresponding path program 1 times [2023-08-03 23:10:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166863930] [2023-08-03 23:10:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:10:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:10:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166863930] [2023-08-03 23:10:56,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166863930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:10:56,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:10:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:10:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141087984] [2023-08-03 23:10:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:10:56,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:10:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:10:56,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:10:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:10:56,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 198 [2023-08-03 23:10:56,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:56,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:10:56,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 198 [2023-08-03 23:10:56,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:10:57,721 INFO L124 PetriNetUnfolderBase]: 4712/7086 cut-off events. [2023-08-03 23:10:57,721 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-08-03 23:10:57,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14381 conditions, 7086 events. 4712/7086 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44623 event pairs, 3944 based on Foata normal form. 0/6238 useless extension candidates. Maximal degree in co-relation 4514. Up to 6628 conditions per place. [2023-08-03 23:10:57,761 INFO L140 encePairwiseOnDemand]: 195/198 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-03 23:10:57,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 172 flow [2023-08-03 23:10:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:10:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:10:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-03 23:10:57,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791245791245792 [2023-08-03 23:10:57,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-03 23:10:57,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-03 23:10:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:10:57,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-03 23:10:57,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:57,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:57,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:57,767 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 344 transitions. [2023-08-03 23:10:57,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 172 flow [2023-08-03 23:10:57,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:10:57,769 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 106 flow [2023-08-03 23:10:57,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-03 23:10:57,770 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-03 23:10:57,770 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 106 flow [2023-08-03 23:10:57,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:57,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:57,770 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:10:57,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:10:57,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:57,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1199626084, now seen corresponding path program 1 times [2023-08-03 23:10:57,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322897360] [2023-08-03 23:10:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:10:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:10:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322897360] [2023-08-03 23:10:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322897360] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:10:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786527603] [2023-08-03 23:10:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:10:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:10:57,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:10:57,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:10:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:57,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:10:57,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:10:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:10:57,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:10:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786527603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:10:57,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:10:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:10:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410154939] [2023-08-03 23:10:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:10:57,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:10:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:10:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:10:57,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:10:57,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 198 [2023-08-03 23:10:57,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:57,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:10:57,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 198 [2023-08-03 23:10:57,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:10:58,520 INFO L124 PetriNetUnfolderBase]: 4672/6933 cut-off events. [2023-08-03 23:10:58,520 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-08-03 23:10:58,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14163 conditions, 6933 events. 4672/6933 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43290 event pairs, 3264 based on Foata normal form. 25/6160 useless extension candidates. Maximal degree in co-relation 8041. Up to 6499 conditions per place. [2023-08-03 23:10:58,555 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 36 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-03 23:10:58,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 212 flow [2023-08-03 23:10:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:10:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:10:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-08-03 23:10:58,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5616161616161616 [2023-08-03 23:10:58,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-08-03 23:10:58,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-08-03 23:10:58,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:10:58,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-08-03 23:10:58,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:58,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:58,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:58,562 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 5 states and 556 transitions. [2023-08-03 23:10:58,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 212 flow [2023-08-03 23:10:58,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:10:58,564 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 120 flow [2023-08-03 23:10:58,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-03 23:10:58,566 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2023-08-03 23:10:58,566 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 120 flow [2023-08-03 23:10:58,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:58,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:58,566 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:10:58,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 23:10:58,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:10:58,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:58,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1634196011, now seen corresponding path program 1 times [2023-08-03 23:10:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754784931] [2023-08-03 23:10:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:10:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:10:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754784931] [2023-08-03 23:10:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754784931] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:10:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027277144] [2023-08-03 23:10:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:58,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:10:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:10:58,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:10:58,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:10:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:58,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:10:58,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:10:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:10:58,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:10:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:10:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027277144] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:10:58,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:10:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:10:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16125260] [2023-08-03 23:10:58,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:10:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:10:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:10:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:10:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:10:58,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 198 [2023-08-03 23:10:58,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:58,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:10:58,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 198 [2023-08-03 23:10:58,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:10:59,450 INFO L124 PetriNetUnfolderBase]: 4108/6145 cut-off events. [2023-08-03 23:10:59,450 INFO L125 PetriNetUnfolderBase]: For 520/520 co-relation queries the response was YES. [2023-08-03 23:10:59,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12514 conditions, 6145 events. 4108/6145 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 37910 event pairs, 1612 based on Foata normal form. 5/5435 useless extension candidates. Maximal degree in co-relation 4582. Up to 5631 conditions per place. [2023-08-03 23:10:59,474 INFO L140 encePairwiseOnDemand]: 195/198 looper letters, 36 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-03 23:10:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 218 flow [2023-08-03 23:10:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:10:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:10:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-03 23:10:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2023-08-03 23:10:59,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-03 23:10:59,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-03 23:10:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:10:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-03 23:10:59,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:59,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:59,478 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:59,478 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 120 flow. Second operand 4 states and 452 transitions. [2023-08-03 23:10:59,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 218 flow [2023-08-03 23:10:59,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 213 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:10:59,480 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 113 flow [2023-08-03 23:10:59,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-03 23:10:59,480 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-03 23:10:59,480 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 113 flow [2023-08-03 23:10:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:59,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:10:59,481 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:10:59,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 23:10:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:10:59,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:10:59,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:10:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash 190652439, now seen corresponding path program 1 times [2023-08-03 23:10:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:10:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624083615] [2023-08-03 23:10:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:59,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:10:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:10:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:10:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624083615] [2023-08-03 23:10:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624083615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:10:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908426368] [2023-08-03 23:10:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:10:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:10:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:10:59,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:10:59,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:10:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:10:59,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:10:59,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:10:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:10:59,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:10:59,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908426368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:10:59,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:10:59,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:10:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113366716] [2023-08-03 23:10:59,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:10:59,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:10:59,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:10:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:10:59,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:10:59,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 198 [2023-08-03 23:10:59,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:10:59,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:10:59,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 198 [2023-08-03 23:10:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:00,132 INFO L124 PetriNetUnfolderBase]: 2108/3413 cut-off events. [2023-08-03 23:11:00,132 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-08-03 23:11:00,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7087 conditions, 3413 events. 2108/3413 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20293 event pairs, 68 based on Foata normal form. 625/3619 useless extension candidates. Maximal degree in co-relation 2555. Up to 2550 conditions per place. [2023-08-03 23:11:00,139 INFO L140 encePairwiseOnDemand]: 196/198 looper letters, 0 selfloop transitions, 0 changer transitions 56/56 dead transitions. [2023-08-03 23:11:00,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 241 flow [2023-08-03 23:11:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:11:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:11:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-03 23:11:00,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-03 23:11:00,140 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-03 23:11:00,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-03 23:11:00,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:00,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-03 23:11:00,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:00,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:00,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:00,143 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 113 flow. Second operand 4 states and 462 transitions. [2023-08-03 23:11:00,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 241 flow [2023-08-03 23:11:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:11:00,148 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2023-08-03 23:11:00,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2023-08-03 23:11:00,149 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-08-03 23:11:00,149 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2023-08-03 23:11:00,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:00,149 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:11:00,149 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:11:00,156 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 23:11:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:11:00,354 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:11:00,354 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:11:00,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,395 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 23:11:00,396 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:11:00,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1945 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:11:00,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,397 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:11:00,398 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,398 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 280 flow [2023-08-03 23:11:00,427 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 23:11:00,427 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:11:00,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1945 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 23:11:00,433 INFO L119 LiptonReduction]: Number of co-enabled transitions 4308 [2023-08-03 23:11:02,401 INFO L134 LiptonReduction]: Checked pairs total: 15873 [2023-08-03 23:11:02,401 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 23:11:02,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:11:02,408 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;@7c66eeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:11:02,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:11:02,437 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:11:02,437 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-03 23:11:02,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:11:02,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:02,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-03 23:11:02,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:02,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 23731026, now seen corresponding path program 1 times [2023-08-03 23:11:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513031005] [2023-08-03 23:11:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:11:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513031005] [2023-08-03 23:11:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513031005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:11:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280030900] [2023-08-03 23:11:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:02,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:02,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-08-03 23:11:02,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:02,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:02,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-08-03 23:11:02,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:04,357 INFO L124 PetriNetUnfolderBase]: 15750/25070 cut-off events. [2023-08-03 23:11:04,357 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2023-08-03 23:11:04,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47231 conditions, 25070 events. 15750/25070 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 189392 event pairs, 3042 based on Foata normal form. 0/21121 useless extension candidates. Maximal degree in co-relation 40029. Up to 20155 conditions per place. [2023-08-03 23:11:04,432 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 49 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-08-03 23:11:04,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 269 flow [2023-08-03 23:11:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-03 23:11:04,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55359765051395 [2023-08-03 23:11:04,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-03 23:11:04,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-03 23:11:04,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:04,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-03 23:11:04,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:04,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:04,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:04,436 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 110 flow. Second operand 3 states and 377 transitions. [2023-08-03 23:11:04,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 269 flow [2023-08-03 23:11:04,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 265 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:11:04,437 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 125 flow [2023-08-03 23:11:04,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-03 23:11:04,438 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-03 23:11:04,438 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 125 flow [2023-08-03 23:11:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:04,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:04,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:11:04,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:11:04,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:04,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 736052334, now seen corresponding path program 1 times [2023-08-03 23:11:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733011452] [2023-08-03 23:11:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:11:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:11:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:11:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733011452] [2023-08-03 23:11:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733011452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:11:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:11:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:11:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326848349] [2023-08-03 23:11:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:11:04,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:11:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:11:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:11:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:11:04,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 227 [2023-08-03 23:11:04,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:04,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:11:04,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 227 [2023-08-03 23:11:04,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:11:06,309 INFO L124 PetriNetUnfolderBase]: 15466/22204 cut-off events. [2023-08-03 23:11:06,310 INFO L125 PetriNetUnfolderBase]: For 2361/2361 co-relation queries the response was YES. [2023-08-03 23:11:06,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47839 conditions, 22204 events. 15466/22204 cut-off events. For 2361/2361 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 146055 event pairs, 14370 based on Foata normal form. 0/18955 useless extension candidates. Maximal degree in co-relation 30994. Up to 21157 conditions per place. [2023-08-03 23:11:06,397 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-03 23:11:06,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 212 flow [2023-08-03 23:11:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:11:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:11:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-03 23:11:06,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110132158590308 [2023-08-03 23:11:06,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-03 23:11:06,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-03 23:11:06,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:11:06,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-03 23:11:06,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:06,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:06,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:06,400 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 125 flow. Second operand 3 states and 348 transitions. [2023-08-03 23:11:06,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 212 flow [2023-08-03 23:11:06,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:11:06,402 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 134 flow [2023-08-03 23:11:06,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-03 23:11:06,403 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-03 23:11:06,403 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 134 flow [2023-08-03 23:11:06,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:11:06,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:11:06,403 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:11:06,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 23:11:06,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:11:06,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:11:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 170771515, now seen corresponding path program 1 times [2023-08-03 23:11:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:11:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392643122] [2023-08-03 23:11:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:11:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:11:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:06,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:11:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:11:06,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:11:06,425 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:11:06,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:11:06,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:11:06,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:11:06,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:11:06,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:11:06,425 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-03 23:11:06,426 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:11:06,428 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:11:06,428 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:11:06,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:11:06 BasicIcfg [2023-08-03 23:11:06,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:11:06,452 INFO L158 Benchmark]: Toolchain (without parser) took 15388.87ms. Allocated memory was 710.9MB in the beginning and 2.2GB in the end (delta: 1.5GB). Free memory was 660.8MB in the beginning and 1.3GB in the end (delta: -615.6MB). Peak memory consumption was 847.5MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,452 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 408.6MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:11:06,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.96ms. Allocated memory is still 710.9MB. Free memory was 660.5MB in the beginning and 637.7MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 710.9MB. Free memory was 637.7MB in the beginning and 635.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,453 INFO L158 Benchmark]: Boogie Preprocessor took 18.92ms. Allocated memory is still 710.9MB. Free memory was 635.3MB in the beginning and 633.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,453 INFO L158 Benchmark]: RCFGBuilder took 509.52ms. Allocated memory is still 710.9MB. Free memory was 633.2MB in the beginning and 660.3MB in the end (delta: -27.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,453 INFO L158 Benchmark]: TraceAbstraction took 14407.74ms. Allocated memory was 710.9MB in the beginning and 2.2GB in the end (delta: 1.5GB). Free memory was 659.3MB in the beginning and 1.3GB in the end (delta: -617.1MB). Peak memory consumption was 844.6MB. Max. memory is 16.0GB. [2023-08-03 23:11:06,454 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.09ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 408.6MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 419.96ms. Allocated memory is still 710.9MB. Free memory was 660.5MB in the beginning and 637.7MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 710.9MB. Free memory was 637.7MB in the beginning and 635.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.92ms. Allocated memory is still 710.9MB. Free memory was 635.3MB in the beginning and 633.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 509.52ms. Allocated memory is still 710.9MB. Free memory was 633.2MB in the beginning and 660.3MB in the end (delta: -27.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.0GB. * TraceAbstraction took 14407.74ms. Allocated memory was 710.9MB in the beginning and 2.2GB in the end (delta: 1.5GB). Free memory was 659.3MB in the beginning and 1.3GB in the end (delta: -617.1MB). Peak memory consumption was 844.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 85 PlacesBefore, 23 PlacesAfterwards, 81 TransitionsBefore, 18 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 1587 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1083, independent: 997, independent conditional: 0, independent unconditional: 997, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 443, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1083, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 443, unknown conditional: 0, unknown unconditional: 443] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 109 PlacesBefore, 46 PlacesAfterwards, 101 TransitionsBefore, 37 TransitionsAfterwards, 2364 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 9192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3323, independent: 3074, independent conditional: 0, independent unconditional: 3074, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1117, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3323, independent: 1990, independent conditional: 0, independent unconditional: 1990, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 1117, unknown conditional: 0, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 133 PlacesBefore, 51 PlacesAfterwards, 128 TransitionsBefore, 43 TransitionsAfterwards, 4308 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, 15873 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5316, independent: 4993, independent conditional: 0, independent unconditional: 4993, dependent: 323, dependent conditional: 0, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2176, independent: 2124, independent conditional: 0, independent unconditional: 2124, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5316, independent: 2869, independent conditional: 0, independent unconditional: 2869, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 2176, unknown conditional: 0, unknown unconditional: 2176] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241[2]; [L823] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] COND TRUE 0 asdf<2 [L823] FCALL, FORK 0 pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0))=-1, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] COND TRUE 0 asdf<2 [L823] FCALL, FORK 0 pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241[asdf], ((void *)0), P0, ((void *)0))=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 2 z$w_buff1 = z$w_buff0 [L745] 2 z$w_buff0 = 1 [L746] 2 z$w_buff1_used = z$w_buff0_used [L747] 2 z$w_buff0_used = (_Bool)1 [L748] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 125 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 41 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=54occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.5s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 23:11:06,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...