/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:59:56,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:59:56,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:59:56,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:59:56,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:59:56,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:59:56,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:59:56,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:59:56,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:59:56,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:59:56,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:59:56,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:59:56,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:59:56,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:59:56,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:59:56,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:59:56,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:59:56,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:59:56,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:59:56,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:59:56,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:59:56,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:59:56,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:59:56,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:59:56,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:59:56,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:59:56,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:59:56,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:59:56,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:59:56,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:59:56,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:59:56,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:59:56,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:59:56,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:59:56,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:59:56,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:59:56,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:59:56,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:59:56,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:59:56,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:59:56,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:59:56,998 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 06:59:57,014 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:59:57,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:59:57,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:59:57,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:59:57,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:59:57,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:59:57,016 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:59:57,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:59:57,016 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:59:57,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:59:57,018 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:59:57,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:59:57,018 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:59:57,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:59:57,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:59:57,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:59:57,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:59:57,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:59:57,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:59:57,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:59:57,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:59:57,021 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 -> AFTER [2023-01-28 06:59:57,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:59:57,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:59:57,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:59:57,230 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:59:57,230 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:59:57,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-01-28 06:59:58,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:59:58,560 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:59:58,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-01-28 06:59:58,579 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0df0eace/f558bdef055143c98ecb84a51b71624e/FLAG4e2e31c5d [2023-01-28 06:59:58,593 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0df0eace/f558bdef055143c98ecb84a51b71624e [2023-01-28 06:59:58,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:59:58,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:59:58,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:59:58,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:59:58,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:59:58,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:59:58" (1/1) ... [2023-01-28 06:59:58,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a88108a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:58, skipping insertion in model container [2023-01-28 06:59:58,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:59:58" (1/1) ... [2023-01-28 06:59:58,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:59:58,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:59:58,786 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/safe002_rmo.oepc.i[993,1006] [2023-01-28 06:59:58,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:59:59,004 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:59:59,017 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/safe002_rmo.oepc.i[993,1006] [2023-01-28 06:59:59,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:59:59,106 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:59:59,106 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:59:59,113 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:59:59,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59 WrapperNode [2023-01-28 06:59:59,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:59:59,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:59:59,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:59:59,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:59:59,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,193 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-01-28 06:59:59,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:59:59,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:59:59,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:59:59,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:59:59,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:59:59,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:59:59,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:59:59,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:59:59,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (1/1) ... [2023-01-28 06:59:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:59:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:59:59,293 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 06:59:59,314 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 06:59:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:59:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:59:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:59:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:59:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:59:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:59:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:59:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:59:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:59:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:59:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:59:59,334 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 06:59:59,516 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:59:59,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:59:59,910 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:00:00,180 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:00:00,181 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:00:00,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:00:00 BoogieIcfgContainer [2023-01-28 07:00:00,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:00:00,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:00:00,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:00:00,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:00:00,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:59:58" (1/3) ... [2023-01-28 07:00:00,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:00:00, skipping insertion in model container [2023-01-28 07:00:00,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:59:59" (2/3) ... [2023-01-28 07:00:00,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e60b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:00:00, skipping insertion in model container [2023-01-28 07:00:00,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:00:00" (3/3) ... [2023-01-28 07:00:00,194 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-01-28 07:00:00,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:00:00,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 07:00:00,210 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:00:00,275 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:00:00,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 07:00:00,380 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 07:00:00,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 07:00:00,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 07:00:00,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-01-28 07:00:00,400 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:00:00,417 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 07:00:00,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 07:00:00,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-01-28 07:00:00,466 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-01-28 07:00:00,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:00,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-01-28 07:00:00,470 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-01-28 07:00:07,741 INFO L134 LiptonReduction]: Checked pairs total: 3777 [2023-01-28 07:00:07,741 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-28 07:00:07,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:00:07,758 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;@1db0240d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:00:07,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:00:07,765 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2023-01-28 07:00:07,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:07,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:07,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:07,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:07,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -378234055, now seen corresponding path program 1 times [2023-01-28 07:00:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853398860] [2023-01-28 07:00:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:08,049 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 07:00:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:08,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853398860] [2023-01-28 07:00:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853398860] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:00:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090808552] [2023-01-28 07:00:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:08,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 07:00:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 07:00:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 07:00:08,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217 [2023-01-28 07:00:08,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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 07:00:08,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:08,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217 [2023-01-28 07:00:08,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:08,335 INFO L130 PetriNetUnfolder]: 511/808 cut-off events. [2023-01-28 07:00:08,335 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 07:00:08,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 808 events. 511/808 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3533 event pairs, 511 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1616. Up to 783 conditions per place. [2023-01-28 07:00:08,346 INFO L137 encePairwiseOnDemand]: 216/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-01-28 07:00:08,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 87 flow [2023-01-28 07:00:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 07:00:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 07:00:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-01-28 07:00:08,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2023-01-28 07:00:08,362 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-01-28 07:00:08,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-01-28 07:00:08,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:08,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-01-28 07:00:08,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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 07:00:08,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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 07:00:08,374 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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 07:00:08,376 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 245 transitions. [2023-01-28 07:00:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 87 flow [2023-01-28 07:00:08,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:08,382 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 48 flow [2023-01-28 07:00:08,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-01-28 07:00:08,387 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-28 07:00:08,387 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 48 flow [2023-01-28 07:00:08,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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 07:00:08,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:08,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:08,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:00:08,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:08,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1159102893, now seen corresponding path program 1 times [2023-01-28 07:00:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236827832] [2023-01-28 07:00:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:08,871 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 07:00:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236827832] [2023-01-28 07:00:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236827832] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:00:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344223376] [2023-01-28 07:00:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:08,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:08,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-01-28 07:00:08,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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 07:00:08,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:08,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-01-28 07:00:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:09,152 INFO L130 PetriNetUnfolder]: 521/872 cut-off events. [2023-01-28 07:00:09,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:09,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 872 events. 521/872 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4167 event pairs, 126 based on Foata normal form. 48/916 useless extension candidates. Maximal degree in co-relation 1720. Up to 556 conditions per place. [2023-01-28 07:00:09,158 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 23 selfloop transitions, 2 changer transitions 14/42 dead transitions. [2023-01-28 07:00:09,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 168 flow [2023-01-28 07:00:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-01-28 07:00:09,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447004608294931 [2023-01-28 07:00:09,163 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-01-28 07:00:09,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-01-28 07:00:09,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:09,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-01-28 07:00:09,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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 07:00:09,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:09,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:09,171 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 48 flow. Second operand 5 states and 591 transitions. [2023-01-28 07:00:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 168 flow [2023-01-28 07:00:09,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:00:09,173 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow [2023-01-28 07:00:09,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-01-28 07:00:09,175 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-01-28 07:00:09,175 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow [2023-01-28 07:00:09,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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 07:00:09,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:09,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:09,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:00:09,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:09,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1572468288, now seen corresponding path program 1 times [2023-01-28 07:00:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223981644] [2023-01-28 07:00:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:09,686 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 07:00:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223981644] [2023-01-28 07:00:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223981644] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:00:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352394587] [2023-01-28 07:00:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:09,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-01-28 07:00:09,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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 07:00:09,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:09,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-01-28 07:00:09,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:09,964 INFO L130 PetriNetUnfolder]: 446/759 cut-off events. [2023-01-28 07:00:09,964 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2023-01-28 07:00:09,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 759 events. 446/759 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3612 event pairs, 143 based on Foata normal form. 36/791 useless extension candidates. Maximal degree in co-relation 1653. Up to 497 conditions per place. [2023-01-28 07:00:09,969 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 28 selfloop transitions, 2 changer transitions 13/46 dead transitions. [2023-01-28 07:00:09,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 205 flow [2023-01-28 07:00:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-01-28 07:00:09,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543778801843318 [2023-01-28 07:00:09,971 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-01-28 07:00:09,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-01-28 07:00:09,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:09,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-01-28 07:00:09,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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 07:00:09,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:09,976 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:09,976 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 590 transitions. [2023-01-28 07:00:09,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 205 flow [2023-01-28 07:00:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 195 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:09,980 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 64 flow [2023-01-28 07:00:09,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-01-28 07:00:09,980 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-28 07:00:09,981 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 64 flow [2023-01-28 07:00:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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 07:00:09,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:09,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:09,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:00:09,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:09,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1468824674, now seen corresponding path program 1 times [2023-01-28 07:00:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530722613] [2023-01-28 07:00:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:10,752 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 07:00:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530722613] [2023-01-28 07:00:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530722613] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:00:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982340374] [2023-01-28 07:00:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:10,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:00:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:10,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:00:10,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:00:10,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 217 [2023-01-28 07:00:10,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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 07:00:10,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:10,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 217 [2023-01-28 07:00:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:11,140 INFO L130 PetriNetUnfolder]: 953/1469 cut-off events. [2023-01-28 07:00:11,141 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2023-01-28 07:00:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 1469 events. 953/1469 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6778 event pairs, 200 based on Foata normal form. 40/1508 useless extension candidates. Maximal degree in co-relation 3522. Up to 633 conditions per place. [2023-01-28 07:00:11,148 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 32 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-01-28 07:00:11,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 268 flow [2023-01-28 07:00:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-01-28 07:00:11,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592933947772657 [2023-01-28 07:00:11,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-01-28 07:00:11,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-01-28 07:00:11,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:11,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-01-28 07:00:11,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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 07:00:11,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:11,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:11,156 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 64 flow. Second operand 6 states and 598 transitions. [2023-01-28 07:00:11,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 268 flow [2023-01-28 07:00:11,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 58 transitions, 254 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:11,159 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 90 flow [2023-01-28 07:00:11,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-01-28 07:00:11,160 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-01-28 07:00:11,160 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 90 flow [2023-01-28 07:00:11,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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 07:00:11,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:11,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:11,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:00:11,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:11,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1266193384, now seen corresponding path program 2 times [2023-01-28 07:00:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208748285] [2023-01-28 07:00:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:12,403 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 07:00:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208748285] [2023-01-28 07:00:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208748285] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:00:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107337470] [2023-01-28 07:00:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:00:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:00:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:00:12,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 217 [2023-01-28 07:00:12,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 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 07:00:12,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:12,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 217 [2023-01-28 07:00:12,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:12,802 INFO L130 PetriNetUnfolder]: 609/979 cut-off events. [2023-01-28 07:00:12,802 INFO L131 PetriNetUnfolder]: For 677/677 co-relation queries the response was YES. [2023-01-28 07:00:12,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 979 events. 609/979 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4404 event pairs, 101 based on Foata normal form. 52/1030 useless extension candidates. Maximal degree in co-relation 2755. Up to 465 conditions per place. [2023-01-28 07:00:12,808 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 29 selfloop transitions, 4 changer transitions 33/67 dead transitions. [2023-01-28 07:00:12,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 377 flow [2023-01-28 07:00:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 07:00:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 07:00:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 756 transitions. [2023-01-28 07:00:12,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2023-01-28 07:00:12,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 756 transitions. [2023-01-28 07:00:12,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 756 transitions. [2023-01-28 07:00:12,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:12,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 756 transitions. [2023-01-28 07:00:12,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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 07:00:12,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 07:00:12,816 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 07:00:12,816 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 90 flow. Second operand 8 states and 756 transitions. [2023-01-28 07:00:12,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 377 flow [2023-01-28 07:00:12,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 360 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:12,821 INFO L231 Difference]: Finished difference. Result has 48 places, 23 transitions, 113 flow [2023-01-28 07:00:12,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=23} [2023-01-28 07:00:12,823 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-01-28 07:00:12,823 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 23 transitions, 113 flow [2023-01-28 07:00:12,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 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 07:00:12,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:12,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:12,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:00:12,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:12,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash -615100251, now seen corresponding path program 1 times [2023-01-28 07:00:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:12,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973871363] [2023-01-28 07:00:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:12,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:13,898 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 07:00:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973871363] [2023-01-28 07:00:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973871363] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:13,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:13,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:00:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337928036] [2023-01-28 07:00:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:00:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:00:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:00:13,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2023-01-28 07:00:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 23 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 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 07:00:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2023-01-28 07:00:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:14,179 INFO L130 PetriNetUnfolder]: 482/770 cut-off events. [2023-01-28 07:00:14,179 INFO L131 PetriNetUnfolder]: For 1109/1109 co-relation queries the response was YES. [2023-01-28 07:00:14,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 770 events. 482/770 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3107 event pairs, 301 based on Foata normal form. 24/793 useless extension candidates. Maximal degree in co-relation 2414. Up to 672 conditions per place. [2023-01-28 07:00:14,184 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 24 selfloop transitions, 7 changer transitions 10/42 dead transitions. [2023-01-28 07:00:14,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 277 flow [2023-01-28 07:00:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-01-28 07:00:14,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48310291858678955 [2023-01-28 07:00:14,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-01-28 07:00:14,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-01-28 07:00:14,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:14,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-01-28 07:00:14,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 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 07:00:14,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:14,191 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:14,192 INFO L175 Difference]: Start difference. First operand has 48 places, 23 transitions, 113 flow. Second operand 6 states and 629 transitions. [2023-01-28 07:00:14,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 277 flow [2023-01-28 07:00:14,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 245 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-01-28 07:00:14,196 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 143 flow [2023-01-28 07:00:14,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-01-28 07:00:14,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2023-01-28 07:00:14,199 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 143 flow [2023-01-28 07:00:14,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 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 07:00:14,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:14,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:14,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:00:14,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:14,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 947827019, now seen corresponding path program 2 times [2023-01-28 07:00:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8636788] [2023-01-28 07:00:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:15,349 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 07:00:15,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8636788] [2023-01-28 07:00:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8636788] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:15,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:15,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:00:15,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769611774] [2023-01-28 07:00:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:15,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:00:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:00:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:00:15,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2023-01-28 07:00:15,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 143 flow. Second operand has 9 states, 9 states have (on average 89.55555555555556) internal successors, (806), 9 states have internal predecessors, (806), 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 07:00:15,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:15,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2023-01-28 07:00:15,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:15,662 INFO L130 PetriNetUnfolder]: 511/817 cut-off events. [2023-01-28 07:00:15,662 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-01-28 07:00:15,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 817 events. 511/817 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3399 event pairs, 295 based on Foata normal form. 24/840 useless extension candidates. Maximal degree in co-relation 2808. Up to 681 conditions per place. [2023-01-28 07:00:15,668 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 25 selfloop transitions, 9 changer transitions 10/45 dead transitions. [2023-01-28 07:00:15,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 330 flow [2023-01-28 07:00:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-01-28 07:00:15,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43701996927803377 [2023-01-28 07:00:15,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-01-28 07:00:15,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-01-28 07:00:15,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:15,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-01-28 07:00:15,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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 07:00:15,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:15,674 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:15,674 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 143 flow. Second operand 6 states and 569 transitions. [2023-01-28 07:00:15,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 330 flow [2023-01-28 07:00:15,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 316 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:15,677 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 194 flow [2023-01-28 07:00:15,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-01-28 07:00:15,678 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-01-28 07:00:15,678 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 194 flow [2023-01-28 07:00:15,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.55555555555556) internal successors, (806), 9 states have internal predecessors, (806), 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 07:00:15,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:15,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:15,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:00:15,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:15,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash -196162235, now seen corresponding path program 3 times [2023-01-28 07:00:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098694621] [2023-01-28 07:00:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:16,933 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 07:00:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098694621] [2023-01-28 07:00:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098694621] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:16,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:16,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 07:00:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765606158] [2023-01-28 07:00:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:16,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 07:00:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 07:00:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-28 07:00:16,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-01-28 07:00:16,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 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 07:00:16,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:16,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-01-28 07:00:16,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:17,269 INFO L130 PetriNetUnfolder]: 540/862 cut-off events. [2023-01-28 07:00:17,272 INFO L131 PetriNetUnfolder]: For 2810/2810 co-relation queries the response was YES. [2023-01-28 07:00:17,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 862 events. 540/862 cut-off events. For 2810/2810 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3610 event pairs, 318 based on Foata normal form. 24/885 useless extension candidates. Maximal degree in co-relation 3444. Up to 726 conditions per place. [2023-01-28 07:00:17,278 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 28 selfloop transitions, 9 changer transitions 10/48 dead transitions. [2023-01-28 07:00:17,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 412 flow [2023-01-28 07:00:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-28 07:00:17,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46927803379416283 [2023-01-28 07:00:17,281 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-28 07:00:17,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-28 07:00:17,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:17,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-28 07:00:17,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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 07:00:17,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:17,286 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:17,286 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 194 flow. Second operand 6 states and 611 transitions. [2023-01-28 07:00:17,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 412 flow [2023-01-28 07:00:17,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 364 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 07:00:17,291 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 230 flow [2023-01-28 07:00:17,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-01-28 07:00:17,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-01-28 07:00:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 230 flow [2023-01-28 07:00:17,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 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 07:00:17,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:17,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:00:17,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:17,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1041021619, now seen corresponding path program 4 times [2023-01-28 07:00:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456896154] [2023-01-28 07:00:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:18,236 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 07:00:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456896154] [2023-01-28 07:00:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456896154] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:18,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899536095] [2023-01-28 07:00:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:00:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:00:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:00:18,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-01-28 07:00:18,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 07:00:18,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:18,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-01-28 07:00:18,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:18,519 INFO L130 PetriNetUnfolder]: 607/968 cut-off events. [2023-01-28 07:00:18,519 INFO L131 PetriNetUnfolder]: For 3798/3798 co-relation queries the response was YES. [2023-01-28 07:00:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 968 events. 607/968 cut-off events. For 3798/3798 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4267 event pairs, 316 based on Foata normal form. 28/995 useless extension candidates. Maximal degree in co-relation 4071. Up to 785 conditions per place. [2023-01-28 07:00:18,528 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 32 selfloop transitions, 14 changer transitions 11/58 dead transitions. [2023-01-28 07:00:18,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 532 flow [2023-01-28 07:00:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-28 07:00:18,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46927803379416283 [2023-01-28 07:00:18,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-28 07:00:18,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-28 07:00:18,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:18,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-28 07:00:18,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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 07:00:18,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:18,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:18,536 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 230 flow. Second operand 6 states and 611 transitions. [2023-01-28 07:00:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 532 flow [2023-01-28 07:00:18,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 487 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:18,542 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 357 flow [2023-01-28 07:00:18,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-28 07:00:18,543 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-01-28 07:00:18,543 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 357 flow [2023-01-28 07:00:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 07:00:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:18,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:18,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:00:18,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:18,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1041915349, now seen corresponding path program 5 times [2023-01-28 07:00:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083526526] [2023-01-28 07:00:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:19,989 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 07:00:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083526526] [2023-01-28 07:00:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083526526] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 07:00:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905761950] [2023-01-28 07:00:19,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 07:00:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:19,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 07:00:19,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-01-28 07:00:19,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 217 [2023-01-28 07:00:20,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 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 07:00:20,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:20,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 217 [2023-01-28 07:00:20,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:20,419 INFO L130 PetriNetUnfolder]: 589/946 cut-off events. [2023-01-28 07:00:20,419 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2023-01-28 07:00:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 946 events. 589/946 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4185 event pairs, 302 based on Foata normal form. 24/969 useless extension candidates. Maximal degree in co-relation 4226. Up to 721 conditions per place. [2023-01-28 07:00:20,428 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 33 selfloop transitions, 17 changer transitions 10/61 dead transitions. [2023-01-28 07:00:20,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 639 flow [2023-01-28 07:00:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2023-01-28 07:00:20,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185867895545315 [2023-01-28 07:00:20,431 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 545 transitions. [2023-01-28 07:00:20,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 545 transitions. [2023-01-28 07:00:20,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:20,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 545 transitions. [2023-01-28 07:00:20,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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 07:00:20,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:20,435 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:20,436 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 357 flow. Second operand 6 states and 545 transitions. [2023-01-28 07:00:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 639 flow [2023-01-28 07:00:20,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 597 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:20,443 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 439 flow [2023-01-28 07:00:20,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-01-28 07:00:20,444 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2023-01-28 07:00:20,444 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 439 flow [2023-01-28 07:00:20,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.4) internal successors, (854), 10 states have internal predecessors, (854), 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 07:00:20,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:20,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:20,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:00:20,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:20,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -807083926, now seen corresponding path program 1 times [2023-01-28 07:00:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071223258] [2023-01-28 07:00:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:22,254 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 07:00:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:22,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071223258] [2023-01-28 07:00:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071223258] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:00:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547552059] [2023-01-28 07:00:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:22,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:00:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:00:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:00:22,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-01-28 07:00:22,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 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 07:00:22,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:22,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-01-28 07:00:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:22,751 INFO L130 PetriNetUnfolder]: 763/1235 cut-off events. [2023-01-28 07:00:22,752 INFO L131 PetriNetUnfolder]: For 6579/6579 co-relation queries the response was YES. [2023-01-28 07:00:22,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1235 events. 763/1235 cut-off events. For 6579/6579 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6011 event pairs, 273 based on Foata normal form. 20/1254 useless extension candidates. Maximal degree in co-relation 5758. Up to 805 conditions per place. [2023-01-28 07:00:22,763 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 47 selfloop transitions, 18 changer transitions 12/78 dead transitions. [2023-01-28 07:00:22,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 833 flow [2023-01-28 07:00:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 07:00:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 07:00:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 766 transitions. [2023-01-28 07:00:22,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412442396313364 [2023-01-28 07:00:22,766 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 766 transitions. [2023-01-28 07:00:22,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 766 transitions. [2023-01-28 07:00:22,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:22,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 766 transitions. [2023-01-28 07:00:22,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 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 07:00:22,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 07:00:22,771 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 07:00:22,771 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 439 flow. Second operand 8 states and 766 transitions. [2023-01-28 07:00:22,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 833 flow [2023-01-28 07:00:22,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 791 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:22,777 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 580 flow [2023-01-28 07:00:22,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-01-28 07:00:22,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2023-01-28 07:00:22,778 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 580 flow [2023-01-28 07:00:22,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 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 07:00:22,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:22,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:00:22,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:22,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1292294960, now seen corresponding path program 2 times [2023-01-28 07:00:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728242000] [2023-01-28 07:00:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:24,021 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 07:00:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728242000] [2023-01-28 07:00:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728242000] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:24,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 07:00:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556688964] [2023-01-28 07:00:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:24,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 07:00:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 07:00:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 07:00:24,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-01-28 07:00:24,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 580 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 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 07:00:24,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:24,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-01-28 07:00:24,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:24,381 INFO L130 PetriNetUnfolder]: 739/1194 cut-off events. [2023-01-28 07:00:24,381 INFO L131 PetriNetUnfolder]: For 7723/7723 co-relation queries the response was YES. [2023-01-28 07:00:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 1194 events. 739/1194 cut-off events. For 7723/7723 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5725 event pairs, 267 based on Foata normal form. 16/1209 useless extension candidates. Maximal degree in co-relation 5679. Up to 786 conditions per place. [2023-01-28 07:00:24,392 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 45 selfloop transitions, 16 changer transitions 8/70 dead transitions. [2023-01-28 07:00:24,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 834 flow [2023-01-28 07:00:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-01-28 07:00:24,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2023-01-28 07:00:24,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-01-28 07:00:24,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-01-28 07:00:24,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:24,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-01-28 07:00:24,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 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 07:00:24,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:24,398 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 07:00:24,399 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 580 flow. Second operand 6 states and 594 transitions. [2023-01-28 07:00:24,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 834 flow [2023-01-28 07:00:24,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 811 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:24,407 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 613 flow [2023-01-28 07:00:24,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-01-28 07:00:24,407 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2023-01-28 07:00:24,407 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 613 flow [2023-01-28 07:00:24,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 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 07:00:24,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:24,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:24,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:00:24,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:24,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 663065424, now seen corresponding path program 1 times [2023-01-28 07:00:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996905049] [2023-01-28 07:00:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:24,652 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 07:00:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996905049] [2023-01-28 07:00:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996905049] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:24,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:00:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705074475] [2023-01-28 07:00:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:24,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:24,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:24,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 07:00:24,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 613 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 07:00:24,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:24,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 07:00:24,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:24,962 INFO L130 PetriNetUnfolder]: 527/953 cut-off events. [2023-01-28 07:00:24,962 INFO L131 PetriNetUnfolder]: For 5739/5823 co-relation queries the response was YES. [2023-01-28 07:00:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 953 events. 527/953 cut-off events. For 5739/5823 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5171 event pairs, 74 based on Foata normal form. 170/1114 useless extension candidates. Maximal degree in co-relation 4217. Up to 559 conditions per place. [2023-01-28 07:00:24,973 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 91 selfloop transitions, 7 changer transitions 11/124 dead transitions. [2023-01-28 07:00:24,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 1461 flow [2023-01-28 07:00:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-01-28 07:00:24,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5336405529953917 [2023-01-28 07:00:24,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-01-28 07:00:24,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-01-28 07:00:24,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:24,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-01-28 07:00:24,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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 07:00:24,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:24,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:24,979 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 613 flow. Second operand 5 states and 579 transitions. [2023-01-28 07:00:24,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 1461 flow [2023-01-28 07:00:24,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 1413 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-01-28 07:00:24,986 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 631 flow [2023-01-28 07:00:24,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=631, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-01-28 07:00:24,987 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2023-01-28 07:00:24,987 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 631 flow [2023-01-28 07:00:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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 07:00:24,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:24,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 07:00:24,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:24,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2109874660, now seen corresponding path program 1 times [2023-01-28 07:00:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780278506] [2023-01-28 07:00:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:25,297 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 07:00:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780278506] [2023-01-28 07:00:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780278506] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188516843] [2023-01-28 07:00:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:25,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:25,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 07:00:25,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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 07:00:25,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:25,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 07:00:25,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:25,544 INFO L130 PetriNetUnfolder]: 387/760 cut-off events. [2023-01-28 07:00:25,544 INFO L131 PetriNetUnfolder]: For 4273/4361 co-relation queries the response was YES. [2023-01-28 07:00:25,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3737 conditions, 760 events. 387/760 cut-off events. For 4273/4361 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4262 event pairs, 23 based on Foata normal form. 128/883 useless extension candidates. Maximal degree in co-relation 3716. Up to 280 conditions per place. [2023-01-28 07:00:25,558 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 96 selfloop transitions, 13 changer transitions 16/139 dead transitions. [2023-01-28 07:00:25,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 139 transitions, 1610 flow [2023-01-28 07:00:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:00:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:00:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2023-01-28 07:00:25,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312705727452272 [2023-01-28 07:00:25,561 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2023-01-28 07:00:25,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2023-01-28 07:00:25,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:25,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2023-01-28 07:00:25,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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 07:00:25,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 07:00:25,565 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 07:00:25,565 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 631 flow. Second operand 7 states and 807 transitions. [2023-01-28 07:00:25,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 139 transitions, 1610 flow [2023-01-28 07:00:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 1588 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:25,576 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 672 flow [2023-01-28 07:00:25,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-01-28 07:00:25,577 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2023-01-28 07:00:25,577 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 672 flow [2023-01-28 07:00:25,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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 07:00:25,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:25,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:25,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 07:00:25,578 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:25,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash -479953228, now seen corresponding path program 1 times [2023-01-28 07:00:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744087154] [2023-01-28 07:00:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:25,829 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 07:00:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744087154] [2023-01-28 07:00:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744087154] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573463922] [2023-01-28 07:00:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:25,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:25,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 217 [2023-01-28 07:00:25,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 672 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 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 07:00:25,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:25,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 217 [2023-01-28 07:00:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:26,152 INFO L130 PetriNetUnfolder]: 708/1363 cut-off events. [2023-01-28 07:00:26,152 INFO L131 PetriNetUnfolder]: For 8249/8322 co-relation queries the response was YES. [2023-01-28 07:00:26,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 1363 events. 708/1363 cut-off events. For 8249/8322 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8135 event pairs, 102 based on Foata normal form. 73/1425 useless extension candidates. Maximal degree in co-relation 7240. Up to 642 conditions per place. [2023-01-28 07:00:26,162 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 79 selfloop transitions, 2 changer transitions 20/114 dead transitions. [2023-01-28 07:00:26,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 1325 flow [2023-01-28 07:00:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-01-28 07:00:26,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327188940092166 [2023-01-28 07:00:26,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-01-28 07:00:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-01-28 07:00:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:26,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-01-28 07:00:26,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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 07:00:26,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:26,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 07:00:26,168 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 672 flow. Second operand 5 states and 578 transitions. [2023-01-28 07:00:26,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 1325 flow [2023-01-28 07:00:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 1260 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-28 07:00:26,193 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 641 flow [2023-01-28 07:00:26,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-01-28 07:00:26,194 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2023-01-28 07:00:26,194 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 641 flow [2023-01-28 07:00:26,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 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 07:00:26,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:26,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 07:00:26,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:26,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1863612142, now seen corresponding path program 2 times [2023-01-28 07:00:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580816419] [2023-01-28 07:00:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:26,458 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 07:00:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580816419] [2023-01-28 07:00:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580816419] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:00:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133747776] [2023-01-28 07:00:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:26,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:00:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:00:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:00:26,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 07:00:26,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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 07:00:26,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:26,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 07:00:26,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:26,728 INFO L130 PetriNetUnfolder]: 403/823 cut-off events. [2023-01-28 07:00:26,728 INFO L131 PetriNetUnfolder]: For 4427/4524 co-relation queries the response was YES. [2023-01-28 07:00:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 823 events. 403/823 cut-off events. For 4427/4524 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4965 event pairs, 21 based on Foata normal form. 113/929 useless extension candidates. Maximal degree in co-relation 4031. Up to 244 conditions per place. [2023-01-28 07:00:26,733 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 53 selfloop transitions, 15 changer transitions 62/138 dead transitions. [2023-01-28 07:00:26,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1624 flow [2023-01-28 07:00:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:00:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:00:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1017 transitions. [2023-01-28 07:00:26,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207373271889401 [2023-01-28 07:00:26,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1017 transitions. [2023-01-28 07:00:26,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1017 transitions. [2023-01-28 07:00:26,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:26,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1017 transitions. [2023-01-28 07:00:26,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 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 07:00:26,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 07:00:26,742 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 07:00:26,742 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 641 flow. Second operand 9 states and 1017 transitions. [2023-01-28 07:00:26,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1624 flow [2023-01-28 07:00:26,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 138 transitions, 1481 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-01-28 07:00:26,752 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 403 flow [2023-01-28 07:00:26,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-01-28 07:00:26,753 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2023-01-28 07:00:26,753 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 403 flow [2023-01-28 07:00:26,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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 07:00:26,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:26,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:26,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 07:00:26,754 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 07:00:26,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1505780361, now seen corresponding path program 1 times [2023-01-28 07:00:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:26,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727519450] [2023-01-28 07:00:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:00:26,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:00:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:00:26,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:00:26,901 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:00:26,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 07:00:26,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 07:00:26,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 07:00:26,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 07:00:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 07:00:26,904 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:26,908 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:00:26,908 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:00:27,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:00:27 BasicIcfg [2023-01-28 07:00:27,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:00:27,002 INFO L158 Benchmark]: Toolchain (without parser) took 28406.74ms. Allocated memory was 346.0MB in the beginning and 893.4MB in the end (delta: 547.4MB). Free memory was 302.7MB in the beginning and 356.5MB in the end (delta: -53.8MB). Peak memory consumption was 495.3MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,002 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 255.9MB. Free memory was 213.0MB in the beginning and 212.9MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.33ms. Allocated memory is still 346.0MB. Free memory was 302.7MB in the beginning and 277.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.49ms. Allocated memory is still 346.0MB. Free memory was 277.2MB in the beginning and 274.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,003 INFO L158 Benchmark]: Boogie Preprocessor took 61.96ms. Allocated memory is still 346.0MB. Free memory was 274.1MB in the beginning and 271.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,003 INFO L158 Benchmark]: RCFGBuilder took 926.39ms. Allocated memory is still 346.0MB. Free memory was 271.6MB in the beginning and 259.6MB in the end (delta: 11.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,004 INFO L158 Benchmark]: TraceAbstraction took 26814.52ms. Allocated memory was 346.0MB in the beginning and 893.4MB in the end (delta: 547.4MB). Free memory was 258.8MB in the beginning and 356.5MB in the end (delta: -97.7MB). Peak memory consumption was 450.3MB. Max. memory is 16.0GB. [2023-01-28 07:00:27,005 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.53ms. Allocated memory is still 255.9MB. Free memory was 213.0MB in the beginning and 212.9MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 517.33ms. Allocated memory is still 346.0MB. Free memory was 302.7MB in the beginning and 277.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.49ms. Allocated memory is still 346.0MB. Free memory was 277.2MB in the beginning and 274.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 61.96ms. Allocated memory is still 346.0MB. Free memory was 274.1MB in the beginning and 271.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 926.39ms. Allocated memory is still 346.0MB. Free memory was 271.6MB in the beginning and 259.6MB in the end (delta: 11.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.0GB. * TraceAbstraction took 26814.52ms. Allocated memory was 346.0MB in the beginning and 893.4MB in the end (delta: 547.4MB). Free memory was 258.8MB in the beginning and 356.5MB in the end (delta: -97.7MB). Peak memory consumption was 450.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 119 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1355, independent: 1157, independent conditional: 0, independent unconditional: 1157, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 612, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1355, independent: 576, independent conditional: 0, independent unconditional: 576, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 612, unknown conditional: 0, unknown unconditional: 612] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1837, ((void *)0), P0, ((void *)0))=1, t1837={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1838; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1838, ((void *)0), P1, ((void *)0))=2, t1837={7:0}, t1838={5:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1839; [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=3, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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 7 procedures, 150 locations, 4 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: 26.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 9 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=672occurred in iteration=14, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 3308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 07:00:27,022 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...