/usr/bin/java -Xmx8000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:26:59,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:26:59,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:26:59,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:26:59,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:26:59,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:26:59,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:26:59,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:26:59,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:26:59,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:26:59,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:26:59,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:26:59,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:26:59,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:26:59,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:26:59,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:26:59,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:26:59,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:26:59,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:26:59,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:26:59,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:26:59,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:26:59,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:26:59,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:26:59,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:26:59,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:26:59,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:26:59,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:26:59,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:26:59,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:26:59,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:26:59,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:26:59,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:26:59,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:26:59,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:26:59,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:26:59,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:26:59,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:26:59,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:26:59,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:26:59,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:26:59,969 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-SemanticLbe.epf [2022-12-05 20:26:59,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:26:59,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:27:00,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:27:00,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:27:00,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:27:00,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:27:00,002 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:27:00,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:27:00,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:27:00,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:27:00,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:27:00,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:27:00,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:27:00,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:27:00,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:27:00,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:27:00,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:27:00,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:27:00,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:27:00,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:27:00,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:27:00,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:27:00,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:27:00,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:27:00,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:27:00,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 20:27:00,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:27:00,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:27:00,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:27:00,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:27:00,317 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:27:00,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2022-12-05 20:27:01,297 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:27:01,580 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:27:01,581 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2022-12-05 20:27:01,592 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d4d79cb/25679ccfe8884d70b53dc076d65cfa48/FLAG2b9f98a17 [2022-12-05 20:27:01,603 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d4d79cb/25679ccfe8884d70b53dc076d65cfa48 [2022-12-05 20:27:01,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:27:01,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:27:01,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:27:01,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:27:01,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:27:01,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:27:01" (1/1) ... [2022-12-05 20:27:01,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6438ed24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:01, skipping insertion in model container [2022-12-05 20:27:01,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:27:01" (1/1) ... [2022-12-05 20:27:01,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:27:01,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:27:01,856 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-12-05 20:27:02,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:27:02,088 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:27:02,100 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-12-05 20:27:02,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:02,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:02,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:27:02,193 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:27:02,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02 WrapperNode [2022-12-05 20:27:02,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:27:02,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:27:02,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:27:02,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:27:02,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,268 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-05 20:27:02,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:27:02,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:27:02,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:27:02,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:27:02,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,314 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:27:02,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:27:02,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:27:02,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:27:02,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (1/1) ... [2022-12-05 20:27:02,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:27:02,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:27:02,368 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) [2022-12-05 20:27:02,390 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 [2022-12-05 20:27:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:27:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:27:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:27:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:27:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:27:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:27:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:27:02,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:27:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:27:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:27:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:27:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:27:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:27:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:27:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:27:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:27:02,412 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:27:02,576 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:27:02,578 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:27:02,977 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:27:03,291 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:27:03,292 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:27:03,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:27:03 BoogieIcfgContainer [2022-12-05 20:27:03,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:27:03,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:27:03,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:27:03,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:27:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:27:01" (1/3) ... [2022-12-05 20:27:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2343adfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:27:03, skipping insertion in model container [2022-12-05 20:27:03,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:02" (2/3) ... [2022-12-05 20:27:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2343adfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:27:03, skipping insertion in model container [2022-12-05 20:27:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:27:03" (3/3) ... [2022-12-05 20:27:03,303 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2022-12-05 20:27:03,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:27:03,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 20:27:03,320 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:27:03,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:27:03,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-05 20:27:03,482 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-05 20:27:03,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:03,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 20:27:03,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-05 20:27:03,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-05 20:27:03,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:27:03,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-05 20:27:03,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-05 20:27:03,555 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-05 20:27:03,555 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:03,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 20:27:03,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-05 20:27:03,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-05 20:27:14,489 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-05 20:27:14,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:27:14,512 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;@539b0043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:27:14,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 20:27:14,517 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-05 20:27:14,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:14,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:14,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:14,518 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)] === [2022-12-05 20:27:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1263566718, now seen corresponding path program 1 times [2022-12-05 20:27:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:14,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396723932] [2022-12-05 20:27:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:14,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396723932] [2022-12-05 20:27:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396723932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:14,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:14,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994381808] [2022-12-05 20:27:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 20:27:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 20:27:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 20:27:14,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:14,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-12-05 20:27:14,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:14,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:14,923 INFO L130 PetriNetUnfolder]: 293/482 cut-off events. [2022-12-05 20:27:14,923 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 20:27:14,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 482 events. 293/482 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1916 event pairs, 293 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 964. Up to 463 conditions per place. [2022-12-05 20:27:14,928 INFO L137 encePairwiseOnDemand]: 18/19 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2022-12-05 20:27:14,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 77 flow [2022-12-05 20:27:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 20:27:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 20:27:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-05 20:27:14,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-05 20:27:14,939 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 47 flow. Second operand 2 states and 21 transitions. [2022-12-05 20:27:14,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 18 transitions, 77 flow [2022-12-05 20:27:14,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:14,942 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 42 flow [2022-12-05 20:27:14,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-05 20:27:14,946 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-05 20:27:14,947 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 42 flow [2022-12-05 20:27:14,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2022-12-05 20:27:14,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:14,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:14,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:27:14,948 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)] === [2022-12-05 20:27:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1188139055, now seen corresponding path program 1 times [2022-12-05 20:27:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:14,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201422141] [2022-12-05 20:27:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201422141] [2022-12-05 20:27:15,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201422141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:15,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:15,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917068754] [2022-12-05 20:27:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:15,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:15,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:15,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:15,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-12-05 20:27:15,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:15,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:15,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:15,322 INFO L130 PetriNetUnfolder]: 272/461 cut-off events. [2022-12-05 20:27:15,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:15,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 461 events. 272/461 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1862 event pairs, 74 based on Foata normal form. 9/469 useless extension candidates. Maximal degree in co-relation 919. Up to 325 conditions per place. [2022-12-05 20:27:15,326 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-05 20:27:15,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 98 flow [2022-12-05 20:27:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 20:27:15,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2022-12-05 20:27:15,328 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 42 flow. Second operand 3 states and 29 transitions. [2022-12-05 20:27:15,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 98 flow [2022-12-05 20:27:15,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:27:15,329 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 50 flow [2022-12-05 20:27:15,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2022-12-05 20:27:15,330 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-05 20:27:15,331 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 50 flow [2022-12-05 20:27:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-12-05 20:27:15,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:15,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:27:15,331 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)] === [2022-12-05 20:27:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1822395214, now seen corresponding path program 1 times [2022-12-05 20:27:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363847342] [2022-12-05 20:27:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363847342] [2022-12-05 20:27:15,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363847342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775002106] [2022-12-05 20:27:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:15,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:15,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 20:27:15,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-05 20:27:15,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:15,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 20:27:15,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:15,723 INFO L130 PetriNetUnfolder]: 465/770 cut-off events. [2022-12-05 20:27:15,723 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-05 20:27:15,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 770 events. 465/770 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3300 event pairs, 109 based on Foata normal form. 36/802 useless extension candidates. Maximal degree in co-relation 1639. Up to 324 conditions per place. [2022-12-05 20:27:15,728 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2022-12-05 20:27:15,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 161 flow [2022-12-05 20:27:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-05 20:27:15,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2022-12-05 20:27:15,732 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 50 flow. Second operand 4 states and 41 transitions. [2022-12-05 20:27:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 161 flow [2022-12-05 20:27:15,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:15,733 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 60 flow [2022-12-05 20:27:15,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2022-12-05 20:27:15,735 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-05 20:27:15,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 60 flow [2022-12-05 20:27:15,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-05 20:27:15,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:15,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:15,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:27:15,736 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)] === [2022-12-05 20:27:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -659703949, now seen corresponding path program 1 times [2022-12-05 20:27:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029255484] [2022-12-05 20:27:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029255484] [2022-12-05 20:27:15,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029255484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:15,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:15,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001587473] [2022-12-05 20:27:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:15,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:15,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:15,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:15,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-05 20:27:15,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:15,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:15,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:16,019 INFO L130 PetriNetUnfolder]: 175/320 cut-off events. [2022-12-05 20:27:16,019 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-05 20:27:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 320 events. 175/320 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1215 event pairs, 55 based on Foata normal form. 6/324 useless extension candidates. Maximal degree in co-relation 760. Up to 229 conditions per place. [2022-12-05 20:27:16,021 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-05 20:27:16,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 148 flow [2022-12-05 20:27:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 20:27:16,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-05 20:27:16,023 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 60 flow. Second operand 3 states and 34 transitions. [2022-12-05 20:27:16,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 148 flow [2022-12-05 20:27:16,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 131 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 20:27:16,024 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 56 flow [2022-12-05 20:27:16,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-12-05 20:27:16,025 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-05 20:27:16,025 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 56 flow [2022-12-05 20:27:16,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-12-05 20:27:16,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:16,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:27:16,026 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)] === [2022-12-05 20:27:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2113441046, now seen corresponding path program 1 times [2022-12-05 20:27:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:16,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601199355] [2022-12-05 20:27:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:17,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:17,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601199355] [2022-12-05 20:27:17,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601199355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:17,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:17,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267819773] [2022-12-05 20:27:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:17,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:17,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 20:27:17,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-05 20:27:17,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:17,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 20:27:17,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:17,369 INFO L130 PetriNetUnfolder]: 278/485 cut-off events. [2022-12-05 20:27:17,369 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-05 20:27:17,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 485 events. 278/485 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2039 event pairs, 75 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1159. Up to 202 conditions per place. [2022-12-05 20:27:17,373 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 28 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-05 20:27:17,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 172 flow [2022-12-05 20:27:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 20:27:17,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-05 20:27:17,376 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 56 flow. Second operand 4 states and 39 transitions. [2022-12-05 20:27:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 172 flow [2022-12-05 20:27:17,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:17,377 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 90 flow [2022-12-05 20:27:17,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-05 20:27:17,377 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2022-12-05 20:27:17,377 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 90 flow [2022-12-05 20:27:17,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-05 20:27:17,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:17,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:17,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:27:17,378 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)] === [2022-12-05 20:27:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1952731710, now seen corresponding path program 2 times [2022-12-05 20:27:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:17,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994285727] [2022-12-05 20:27:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:18,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994285727] [2022-12-05 20:27:18,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994285727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:18,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:18,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809167624] [2022-12-05 20:27:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:18,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 20:27:18,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-05 20:27:18,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:18,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 20:27:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:18,407 INFO L130 PetriNetUnfolder]: 270/473 cut-off events. [2022-12-05 20:27:18,407 INFO L131 PetriNetUnfolder]: For 202/202 co-relation queries the response was YES. [2022-12-05 20:27:18,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 473 events. 270/473 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1983 event pairs, 53 based on Foata normal form. 4/476 useless extension candidates. Maximal degree in co-relation 1248. Up to 214 conditions per place. [2022-12-05 20:27:18,410 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-05 20:27:18,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 196 flow [2022-12-05 20:27:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 20:27:18,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-05 20:27:18,412 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 90 flow. Second operand 4 states and 37 transitions. [2022-12-05 20:27:18,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 196 flow [2022-12-05 20:27:18,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:18,413 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 106 flow [2022-12-05 20:27:18,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-05 20:27:18,414 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2022-12-05 20:27:18,414 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 106 flow [2022-12-05 20:27:18,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-05 20:27:18,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:18,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:18,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:27:18,415 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)] === [2022-12-05 20:27:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1092165473, now seen corresponding path program 1 times [2022-12-05 20:27:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:18,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864529341] [2022-12-05 20:27:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:18,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864529341] [2022-12-05 20:27:18,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864529341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:18,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:18,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060140763] [2022-12-05 20:27:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:18,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:18,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:18,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-12-05 20:27:18,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:18,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:18,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:18,697 INFO L130 PetriNetUnfolder]: 221/415 cut-off events. [2022-12-05 20:27:18,698 INFO L131 PetriNetUnfolder]: For 388/388 co-relation queries the response was YES. [2022-12-05 20:27:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 415 events. 221/415 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1835 event pairs, 55 based on Foata normal form. 41/454 useless extension candidates. Maximal degree in co-relation 1132. Up to 275 conditions per place. [2022-12-05 20:27:18,700 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 34 selfloop transitions, 7 changer transitions 8/53 dead transitions. [2022-12-05 20:27:18,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 320 flow [2022-12-05 20:27:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 20:27:18,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2022-12-05 20:27:18,702 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 106 flow. Second operand 5 states and 54 transitions. [2022-12-05 20:27:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 320 flow [2022-12-05 20:27:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:18,704 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 156 flow [2022-12-05 20:27:18,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-05 20:27:18,705 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2022-12-05 20:27:18,705 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 156 flow [2022-12-05 20:27:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-12-05 20:27:18,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:18,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:18,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:27:18,706 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)] === [2022-12-05 20:27:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2141557087, now seen corresponding path program 1 times [2022-12-05 20:27:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:18,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800527902] [2022-12-05 20:27:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:18,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800527902] [2022-12-05 20:27:18,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800527902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:18,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:18,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025822689] [2022-12-05 20:27:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:18,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:27:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:27:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:27:18,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:18,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-05 20:27:18,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:18,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:19,000 INFO L130 PetriNetUnfolder]: 171/348 cut-off events. [2022-12-05 20:27:19,000 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-05 20:27:19,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 348 events. 171/348 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1599 event pairs, 14 based on Foata normal form. 28/374 useless extension candidates. Maximal degree in co-relation 1277. Up to 149 conditions per place. [2022-12-05 20:27:19,003 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 39 selfloop transitions, 13 changer transitions 12/68 dead transitions. [2022-12-05 20:27:19,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 474 flow [2022-12-05 20:27:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:27:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:27:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-05 20:27:19,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5413533834586466 [2022-12-05 20:27:19,004 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 156 flow. Second operand 7 states and 72 transitions. [2022-12-05 20:27:19,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 474 flow [2022-12-05 20:27:19,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:19,007 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 240 flow [2022-12-05 20:27:19,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2022-12-05 20:27:19,008 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 23 predicate places. [2022-12-05 20:27:19,008 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 240 flow [2022-12-05 20:27:19,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-12-05 20:27:19,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:19,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:19,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:27:19,009 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)] === [2022-12-05 20:27:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash 572705165, now seen corresponding path program 1 times [2022-12-05 20:27:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:19,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307805669] [2022-12-05 20:27:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:19,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307805669] [2022-12-05 20:27:19,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307805669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:19,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:19,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816209868] [2022-12-05 20:27:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:19,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:19,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 20:27:19,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-05 20:27:19,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:19,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 20:27:19,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:19,280 INFO L130 PetriNetUnfolder]: 310/633 cut-off events. [2022-12-05 20:27:19,281 INFO L131 PetriNetUnfolder]: For 1716/1716 co-relation queries the response was YES. [2022-12-05 20:27:19,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 633 events. 310/633 cut-off events. For 1716/1716 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3306 event pairs, 65 based on Foata normal form. 5/628 useless extension candidates. Maximal degree in co-relation 2610. Up to 332 conditions per place. [2022-12-05 20:27:19,285 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 50 selfloop transitions, 2 changer transitions 11/66 dead transitions. [2022-12-05 20:27:19,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 588 flow [2022-12-05 20:27:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 20:27:19,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-05 20:27:19,286 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 240 flow. Second operand 4 states and 37 transitions. [2022-12-05 20:27:19,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 588 flow [2022-12-05 20:27:19,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 523 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:19,295 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 207 flow [2022-12-05 20:27:19,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2022-12-05 20:27:19,296 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 26 predicate places. [2022-12-05 20:27:19,296 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 207 flow [2022-12-05 20:27:19,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-05 20:27:19,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:19,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:27:19,297 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)] === [2022-12-05 20:27:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -643549465, now seen corresponding path program 2 times [2022-12-05 20:27:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246571753] [2022-12-05 20:27:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:19,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246571753] [2022-12-05 20:27:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246571753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:19,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:27:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227909160] [2022-12-05 20:27:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:19,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 20:27:19,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-12-05 20:27:19,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:19,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 20:27:19,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:19,638 INFO L130 PetriNetUnfolder]: 186/402 cut-off events. [2022-12-05 20:27:19,639 INFO L131 PetriNetUnfolder]: For 777/786 co-relation queries the response was YES. [2022-12-05 20:27:19,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 402 events. 186/402 cut-off events. For 777/786 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2015 event pairs, 14 based on Foata normal form. 24/415 useless extension candidates. Maximal degree in co-relation 1545. Up to 106 conditions per place. [2022-12-05 20:27:19,642 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 32 selfloop transitions, 15 changer transitions 17/67 dead transitions. [2022-12-05 20:27:19,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 504 flow [2022-12-05 20:27:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:27:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:27:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-05 20:27:19,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4327485380116959 [2022-12-05 20:27:19,645 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 207 flow. Second operand 9 states and 74 transitions. [2022-12-05 20:27:19,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 504 flow [2022-12-05 20:27:19,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 466 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-05 20:27:19,649 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 225 flow [2022-12-05 20:27:19,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2022-12-05 20:27:19,651 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 31 predicate places. [2022-12-05 20:27:19,651 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 225 flow [2022-12-05 20:27:19,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-12-05 20:27:19,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:19,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:19,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:27:19,652 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)] === [2022-12-05 20:27:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -843823824, now seen corresponding path program 1 times [2022-12-05 20:27:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:19,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47756274] [2022-12-05 20:27:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:27:19,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:27:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:27:19,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:27:19,780 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:27:19,781 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 20:27:19,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 20:27:19,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 20:27:19,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 20:27:19,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:27:19,783 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:19,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:27:19,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:27:19,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:27:19 BasicIcfg [2022-12-05 20:27:19,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:27:19,848 INFO L158 Benchmark]: Toolchain (without parser) took 18242.00ms. Allocated memory was 209.7MB in the beginning and 551.6MB in the end (delta: 341.8MB). Free memory was 184.1MB in the beginning and 368.2MB in the end (delta: -184.1MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,848 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 209.7MB. Free memory was 187.7MB in the beginning and 187.6MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:27:19,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.05ms. Allocated memory is still 209.7MB. Free memory was 184.1MB in the beginning and 157.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.50ms. Allocated memory is still 209.7MB. Free memory was 157.8MB in the beginning and 155.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,849 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 153.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,849 INFO L158 Benchmark]: RCFGBuilder took 975.42ms. Allocated memory was 209.7MB in the beginning and 255.9MB in the end (delta: 46.1MB). Free memory was 153.1MB in the beginning and 196.1MB in the end (delta: -43.0MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,849 INFO L158 Benchmark]: TraceAbstraction took 16551.17ms. Allocated memory was 255.9MB in the beginning and 551.6MB in the end (delta: 295.7MB). Free memory was 195.5MB in the beginning and 368.2MB in the end (delta: -172.6MB). Peak memory consumption was 123.7MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,851 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.14ms. Allocated memory is still 209.7MB. Free memory was 187.7MB in the beginning and 187.6MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 586.05ms. Allocated memory is still 209.7MB. Free memory was 184.1MB in the beginning and 157.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.50ms. Allocated memory is still 209.7MB. Free memory was 157.8MB in the beginning and 155.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 209.7MB. Free memory was 155.2MB in the beginning and 153.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 975.42ms. Allocated memory was 209.7MB in the beginning and 255.9MB in the end (delta: 46.1MB). Free memory was 153.1MB in the beginning and 196.1MB in the end (delta: -43.0MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16551.17ms. Allocated memory was 255.9MB in the beginning and 551.6MB in the end (delta: 295.7MB). Free memory was 195.5MB in the beginning and 368.2MB in the end (delta: -172.6MB). Peak memory consumption was 123.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 117 PlacesBefore, 28 PlacesAfterwards, 108 TransitionsBefore, 19 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 725, independent: 669, independent conditional: 669, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 725, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 725, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 725, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 642, independent: 610, independent conditional: 0, independent unconditional: 610, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 642, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 725, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 642, unknown conditional: 0, unknown unconditional: 642] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 892, Positive conditional cache size: 0, Positive unconditional cache size: 892, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L832] 0 pthread_t t2201; [L833] FCALL, FORK 0 pthread_create(&t2201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2201, ((void *)0), P0, ((void *)0))=-2, t2201={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L834] 0 pthread_t t2202; [L835] FCALL, FORK 0 pthread_create(&t2202, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2202, ((void *)0), P1, ((void *)0))=-1, t2201={7:0}, t2202={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L836] 0 pthread_t t2203; [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] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3: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] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3: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] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L837] FCALL, FORK 0 pthread_create(&t2203, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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(&t2203, ((void *)0), P2, ((void *)0))=0, t2201={7:0}, t2202={5:0}, t2203={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L804] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L810] 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) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 \read(y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] 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) [L810] 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) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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_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$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L841] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L841] RET 0 assume_abort_if_not(main$tmp_guard0) [L843] 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) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 \read(y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] 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) [L843] 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) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 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 [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 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=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_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, t2201={7:0}, t2202={5:0}, t2203={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] [L850] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L854] 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=1, __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_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$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3: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] - UnprovableResult [Line: 835]: 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: 833]: 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: 837]: 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, 146 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: 16.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 554 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1 mSDtfsCounter, 554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=8, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2022-12-05 20:27:19,873 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...