/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:38:44,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:38:44,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:38:44,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:38:44,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:38:44,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:38:44,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:38:44,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:38:44,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:38:44,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:38:44,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:38:44,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:38:44,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:38:44,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:38:44,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:38:44,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:38:44,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:38:44,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:38:44,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:38:44,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:38:44,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:38:44,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:38:44,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:38:44,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:38:44,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:38:44,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:38:44,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:38:44,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:38:44,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:38:44,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:38:44,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:38:44,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:38:44,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:38:44,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:38:44,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:38:44,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:38:44,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:38:44,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:38:44,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:38:44,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:38:44,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:38:44,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:38:44,225 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:38:44,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:38:44,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:38:44,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:38:44,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:38:44,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:38:44,227 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:38:44,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:38:44,227 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:38:44,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:38:44,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:38:44,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:38:44,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:38:44,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:38:44,229 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:38:44,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:38:44,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:38:44,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:38:44,426 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:38:44,426 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:38:44,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2023-01-28 00:38:45,453 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:38:45,627 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:38:45,628 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2023-01-28 00:38:45,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395de1bf2/8ff6e66c21cd495ea924dc04a7a50226/FLAGae62981a0 [2023-01-28 00:38:45,660 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395de1bf2/8ff6e66c21cd495ea924dc04a7a50226 [2023-01-28 00:38:45,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:38:45,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:38:45,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:38:45,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:38:45,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:38:45,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:45,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7429adec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45, skipping insertion in model container [2023-01-28 00:38:45,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:45,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:38:45,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:38:45,814 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i[944,957] [2023-01-28 00:38:45,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:38:45,941 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:38:45,949 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i[944,957] [2023-01-28 00:38:45,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:38:45,994 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:38:45,995 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:38:45,999 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:38:46,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45 WrapperNode [2023-01-28 00:38:46,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:38:46,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:38:46,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:38:46,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:38:46,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,038 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-01-28 00:38:46,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:38:46,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:38:46,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:38:46,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:38:46,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,055 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:38:46,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:38:46,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:38:46,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:38:46,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (1/1) ... [2023-01-28 00:38:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:38:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:38:46,109 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-01-28 00:38:46,124 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-01-28 00:38:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:38:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:38:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:38:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:38:46,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:38:46,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:38:46,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:38:46,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:38:46,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:38:46,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:38:46,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:38:46,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:38:46,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:38:46,137 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:38:46,288 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:38:46,290 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:38:46,542 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:38:46,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:38:46,730 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:38:46,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:38:46 BoogieIcfgContainer [2023-01-28 00:38:46,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:38:46,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:38:46,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:38:46,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:38:46,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:38:45" (1/3) ... [2023-01-28 00:38:46,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae3726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:38:46, skipping insertion in model container [2023-01-28 00:38:46,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:38:45" (2/3) ... [2023-01-28 00:38:46,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae3726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:38:46, skipping insertion in model container [2023-01-28 00:38:46,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:38:46" (3/3) ... [2023-01-28 00:38:46,736 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2023-01-28 00:38:46,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:38:46,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:38:46,747 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:38:46,784 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:38:46,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2023-01-28 00:38:46,852 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-01-28 00:38:46,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:46,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 00:38:46,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2023-01-28 00:38:46,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-01-28 00:38:46,866 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:38:46,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-01-28 00:38:46,875 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-01-28 00:38:46,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-01-28 00:38:46,899 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-01-28 00:38:46,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:46,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-01-28 00:38:46,905 INFO L119 LiptonReduction]: Number of co-enabled transitions 1088 [2023-01-28 00:38:49,829 INFO L134 LiptonReduction]: Checked pairs total: 2720 [2023-01-28 00:38:49,829 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-01-28 00:38:49,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:38:49,856 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52483aa6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:38:49,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:38:49,861 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 00:38:49,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:38:49,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:49,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:38:49,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:49,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 420330001, now seen corresponding path program 1 times [2023-01-28 00:38:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429105658] [2023-01-28 00:38:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429105658] [2023-01-28 00:38:50,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429105658] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:38:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321673397] [2023-01-28 00:38:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:50,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:38:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:38:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:38:50,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 168 [2023-01-28 00:38:50,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-01-28 00:38:50,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:50,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 168 [2023-01-28 00:38:50,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:50,346 INFO L130 PetriNetUnfolder]: 142/272 cut-off events. [2023-01-28 00:38:50,346 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 00:38:50,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 272 events. 142/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1084 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 527. Up to 205 conditions per place. [2023-01-28 00:38:50,350 INFO L137 encePairwiseOnDemand]: 165/168 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-01-28 00:38:50,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-01-28 00:38:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:38:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:38:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-01-28 00:38:50,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498015873015873 [2023-01-28 00:38:50,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-01-28 00:38:50,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-01-28 00:38:50,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:50,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-01-28 00:38:50,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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-01-28 00:38:50,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:50,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:50,371 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 251 transitions. [2023-01-28 00:38:50,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-01-28 00:38:50,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:38:50,374 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-01-28 00:38:50,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-01-28 00:38:50,378 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 00:38:50,378 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-01-28 00:38:50,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-01-28 00:38:50,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:50,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:50,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:38:50,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:50,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 210259326, now seen corresponding path program 1 times [2023-01-28 00:38:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700279671] [2023-01-28 00:38:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700279671] [2023-01-28 00:38:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700279671] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:38:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674201167] [2023-01-28 00:38:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:51,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:38:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:51,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:38:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:38:51,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 168 [2023-01-28 00:38:51,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-01-28 00:38:51,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:51,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 168 [2023-01-28 00:38:51,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:51,132 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-01-28 00:38:51,133 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-28 00:38:51,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 278 events. 157/278 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 871 event pairs, 53 based on Foata normal form. 10/288 useless extension candidates. Maximal degree in co-relation 577. Up to 200 conditions per place. [2023-01-28 00:38:51,137 INFO L137 encePairwiseOnDemand]: 165/168 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-01-28 00:38:51,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 96 flow [2023-01-28 00:38:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:38:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:38:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2023-01-28 00:38:51,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4384920634920635 [2023-01-28 00:38:51,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2023-01-28 00:38:51,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2023-01-28 00:38:51,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:51,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2023-01-28 00:38:51,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-01-28 00:38:51,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:51,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:51,143 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 221 transitions. [2023-01-28 00:38:51,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 96 flow [2023-01-28 00:38:51,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:38:51,144 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2023-01-28 00:38:51,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-01-28 00:38:51,145 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 00:38:51,145 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2023-01-28 00:38:51,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-01-28 00:38:51,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:51,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:51,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:38:51,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:51,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 194238590, now seen corresponding path program 1 times [2023-01-28 00:38:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394907322] [2023-01-28 00:38:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394907322] [2023-01-28 00:38:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394907322] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:38:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092401786] [2023-01-28 00:38:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:51,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:38:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:51,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:38:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:38:51,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 168 [2023-01-28 00:38:51,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:51,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:51,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 168 [2023-01-28 00:38:51,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:51,418 INFO L130 PetriNetUnfolder]: 60/135 cut-off events. [2023-01-28 00:38:51,418 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-01-28 00:38:51,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 135 events. 60/135 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 481 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 296. Up to 60 conditions per place. [2023-01-28 00:38:51,419 INFO L137 encePairwiseOnDemand]: 163/168 looper letters, 20 selfloop transitions, 3 changer transitions 15/40 dead transitions. [2023-01-28 00:38:51,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 179 flow [2023-01-28 00:38:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:38:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:38:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 395 transitions. [2023-01-28 00:38:51,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2023-01-28 00:38:51,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 395 transitions. [2023-01-28 00:38:51,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 395 transitions. [2023-01-28 00:38:51,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:51,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 395 transitions. [2023-01-28 00:38:51,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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-01-28 00:38:51,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-01-28 00:38:51,423 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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-01-28 00:38:51,423 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 395 transitions. [2023-01-28 00:38:51,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 179 flow [2023-01-28 00:38:51,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:38:51,424 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 67 flow [2023-01-28 00:38:51,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-01-28 00:38:51,425 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-01-28 00:38:51,425 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 67 flow [2023-01-28 00:38:51,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:51,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:51,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:38:51,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:51,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1577831295, now seen corresponding path program 1 times [2023-01-28 00:38:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166234179] [2023-01-28 00:38:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166234179] [2023-01-28 00:38:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166234179] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:51,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:51,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:38:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220876306] [2023-01-28 00:38:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:38:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:38:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:38:51,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 168 [2023-01-28 00:38:51,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 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-01-28 00:38:51,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:51,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 168 [2023-01-28 00:38:51,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:51,673 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2023-01-28 00:38:51,674 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 00:38:51,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 68 events. 24/68 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 178. Up to 29 conditions per place. [2023-01-28 00:38:51,674 INFO L137 encePairwiseOnDemand]: 163/168 looper letters, 18 selfloop transitions, 5 changer transitions 8/33 dead transitions. [2023-01-28 00:38:51,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 173 flow [2023-01-28 00:38:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:38:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:38:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2023-01-28 00:38:51,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2023-01-28 00:38:51,676 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 459 transitions. [2023-01-28 00:38:51,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 459 transitions. [2023-01-28 00:38:51,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:51,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 459 transitions. [2023-01-28 00:38:51,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-01-28 00:38:51,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 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-01-28 00:38:51,682 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 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-01-28 00:38:51,682 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 67 flow. Second operand 6 states and 459 transitions. [2023-01-28 00:38:51,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 173 flow [2023-01-28 00:38:51,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 154 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 00:38:51,685 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 74 flow [2023-01-28 00:38:51,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-01-28 00:38:51,686 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-01-28 00:38:51,686 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 74 flow [2023-01-28 00:38:51,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 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-01-28 00:38:51,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:51,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:38:51,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:51,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash 854218722, now seen corresponding path program 1 times [2023-01-28 00:38:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642751703] [2023-01-28 00:38:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:52,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642751703] [2023-01-28 00:38:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642751703] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:52,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:38:52,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134042221] [2023-01-28 00:38:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:52,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:38:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:38:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:38:52,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 168 [2023-01-28 00:38:52,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:52,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:52,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 168 [2023-01-28 00:38:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:52,318 INFO L130 PetriNetUnfolder]: 33/91 cut-off events. [2023-01-28 00:38:52,318 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 00:38:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 91 events. 33/91 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 2 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 242. Up to 49 conditions per place. [2023-01-28 00:38:52,318 INFO L137 encePairwiseOnDemand]: 162/168 looper letters, 17 selfloop transitions, 3 changer transitions 20/40 dead transitions. [2023-01-28 00:38:52,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 237 flow [2023-01-28 00:38:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:38:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:38:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 421 transitions. [2023-01-28 00:38:52,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176587301587302 [2023-01-28 00:38:52,321 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 421 transitions. [2023-01-28 00:38:52,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 421 transitions. [2023-01-28 00:38:52,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:52,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 421 transitions. [2023-01-28 00:38:52,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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-01-28 00:38:52,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 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-01-28 00:38:52,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 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-01-28 00:38:52,323 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 74 flow. Second operand 6 states and 421 transitions. [2023-01-28 00:38:52,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 237 flow [2023-01-28 00:38:52,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 206 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-01-28 00:38:52,325 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 71 flow [2023-01-28 00:38:52,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-01-28 00:38:52,327 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-01-28 00:38:52,328 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 71 flow [2023-01-28 00:38:52,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:38:52,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:52,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:38:52,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:52,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1775994410, now seen corresponding path program 2 times [2023-01-28 00:38:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964912941] [2023-01-28 00:38:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:38:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:38:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:38:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964912941] [2023-01-28 00:38:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964912941] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:38:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:38:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:38:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199353820] [2023-01-28 00:38:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:38:53,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:38:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:38:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:38:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:38:53,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 168 [2023-01-28 00:38:53,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 71 flow. Second operand has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 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-01-28 00:38:53,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:38:53,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 168 [2023-01-28 00:38:53,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:38:53,457 INFO L130 PetriNetUnfolder]: 13/53 cut-off events. [2023-01-28 00:38:53,457 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-01-28 00:38:53,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 53 events. 13/53 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 153. Up to 19 conditions per place. [2023-01-28 00:38:53,457 INFO L137 encePairwiseOnDemand]: 161/168 looper letters, 15 selfloop transitions, 4 changer transitions 14/34 dead transitions. [2023-01-28 00:38:53,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 209 flow [2023-01-28 00:38:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:38:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:38:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2023-01-28 00:38:53,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2023-01-28 00:38:53,459 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 574 transitions. [2023-01-28 00:38:53,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 574 transitions. [2023-01-28 00:38:53,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:38:53,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 574 transitions. [2023-01-28 00:38:53,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 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-01-28 00:38:53,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 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-01-28 00:38:53,461 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 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-01-28 00:38:53,462 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 71 flow. Second operand 8 states and 574 transitions. [2023-01-28 00:38:53,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 209 flow [2023-01-28 00:38:53,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 197 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 00:38:53,463 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 80 flow [2023-01-28 00:38:53,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2023-01-28 00:38:53,463 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2023-01-28 00:38:53,463 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 80 flow [2023-01-28 00:38:53,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 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-01-28 00:38:53,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:38:53,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:38:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:38:53,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:38:53,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:38:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1894243514, now seen corresponding path program 3 times [2023-01-28 00:38:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:38:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36507505] [2023-01-28 00:38:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:38:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:38:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:38:53,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:38:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:38:53,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:38:53,542 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:38:53,542 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:38:53,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 00:38:53,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:38:53,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:38:53,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 00:38:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:38:53,544 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-01-28 00:38:53,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:38:53,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:38:53,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:38:53 BasicIcfg [2023-01-28 00:38:53,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:38:53,575 INFO L158 Benchmark]: Toolchain (without parser) took 7912.68ms. Allocated memory was 625.0MB in the beginning and 773.8MB in the end (delta: 148.9MB). Free memory was 575.6MB in the beginning and 554.9MB in the end (delta: 20.7MB). Peak memory consumption was 170.5MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,575 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 375.4MB. Free memory is still 323.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:38:53,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.74ms. Allocated memory is still 625.0MB. Free memory was 575.2MB in the beginning and 551.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.30ms. Allocated memory is still 625.0MB. Free memory was 551.8MB in the beginning and 548.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,576 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 625.0MB. Free memory was 548.9MB in the beginning and 546.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,576 INFO L158 Benchmark]: RCFGBuilder took 661.49ms. Allocated memory is still 625.0MB. Free memory was 546.8MB in the beginning and 586.5MB in the end (delta: -39.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,577 INFO L158 Benchmark]: TraceAbstraction took 6842.23ms. Allocated memory was 625.0MB in the beginning and 773.8MB in the end (delta: 148.9MB). Free memory was 585.2MB in the beginning and 554.9MB in the end (delta: 30.3MB). Peak memory consumption was 178.4MB. Max. memory is 16.0GB. [2023-01-28 00:38:53,578 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 375.4MB. Free memory is still 323.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 336.74ms. Allocated memory is still 625.0MB. Free memory was 575.2MB in the beginning and 551.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.30ms. Allocated memory is still 625.0MB. Free memory was 551.8MB in the beginning and 548.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 625.0MB. Free memory was 548.9MB in the beginning and 546.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 661.49ms. Allocated memory is still 625.0MB. Free memory was 546.8MB in the beginning and 586.5MB in the end (delta: -39.7MB). Peak memory consumption was 42.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6842.23ms. Allocated memory was 625.0MB in the beginning and 773.8MB in the end (delta: 148.9MB). Free memory was 585.2MB in the beginning and 554.9MB in the end (delta: 30.3MB). Peak memory consumption was 178.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 92 PlacesBefore, 25 PlacesAfterwards, 87 TransitionsBefore, 18 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 2720 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1126, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 602, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1126, independent: 433, independent conditional: 0, independent unconditional: 433, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 602, unknown conditional: 0, unknown unconditional: 602] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597; [L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597, ((void *)0), P0, ((void *)0))=-2, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t598; [L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598, ((void *)0), P1, ((void *)0))=-1, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597={5:0}, t598={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)0 [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - 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. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 108 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: 6.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 7 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, InterpolantAutomatonStates: 31, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-01-28 00:38:53,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...