/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:28:59,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:28:59,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:28:59,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:28:59,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:28:59,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:29:00,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:29:00,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:29:00,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:29:00,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:29:00,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:29:00,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:29:00,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:29:00,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:29:00,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:29:00,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:29:00,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:29:00,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:29:00,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:29:00,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:29:00,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:29:00,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:29:00,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:29:00,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:29:00,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:29:00,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:29:00,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:29:00,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:29:00,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:29:00,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:29:00,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:29:00,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:29:00,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:29:00,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:29:00,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:29:00,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:29:00,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:29:00,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:29:00,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:29:00,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:29:00,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:29:00,041 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:29:00,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:29:00,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:29:00,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:29:00,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:29:00,075 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:29:00,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:29:00,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:29:00,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:29:00,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:29:00,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:29:00,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:29:00,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:00,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:29:00,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:29:00,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:29:00,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:29:00,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:29:00,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:29:00,079 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-06 04:29:00,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:29:00,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:29:00,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:29:00,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:29:00,434 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:29:00,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-06 04:29:01,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:29:01,716 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:29:01,716 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-06 04:29:01,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2a3b6b0/32cb80d928cf4a4298478ece08486260/FLAG5cf80ce71 [2022-12-06 04:29:01,758 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2a3b6b0/32cb80d928cf4a4298478ece08486260 [2022-12-06 04:29:01,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:29:01,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:29:01,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:01,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:29:01,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:29:01,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:01" (1/1) ... [2022-12-06 04:29:01,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660e1f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:01, skipping insertion in model container [2022-12-06 04:29:01,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:01" (1/1) ... [2022-12-06 04:29:01,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:29:01,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:29:01,968 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/safe015_power.opt.i[994,1007] [2022-12-06 04:29:02,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:02,185 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:29:02,193 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/safe015_power.opt.i[994,1007] [2022-12-06 04:29:02,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:02,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:02,293 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:29:02,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02 WrapperNode [2022-12-06 04:29:02,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:02,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:02,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:29:02,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:29:02,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,360 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-12-06 04:29:02,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:02,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:29:02,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:29:02,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:29:02,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,396 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:29:02,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:29:02,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:29:02,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:29:02,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (1/1) ... [2022-12-06 04:29:02,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:02,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:29:02,485 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-06 04:29:02,491 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-06 04:29:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:29:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:29:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:29:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:29:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:29:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:29:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:29:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:29:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:29:02,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:29:02,514 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:29:02,619 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:29:02,621 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:29:03,084 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:29:03,360 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:29:03,361 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:29:03,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:03 BoogieIcfgContainer [2022-12-06 04:29:03,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:29:03,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:29:03,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:29:03,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:29:03,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:29:01" (1/3) ... [2022-12-06 04:29:03,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:03, skipping insertion in model container [2022-12-06 04:29:03,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:02" (2/3) ... [2022-12-06 04:29:03,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:03, skipping insertion in model container [2022-12-06 04:29:03,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:03" (3/3) ... [2022-12-06 04:29:03,370 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-12-06 04:29:03,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:29:03,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:29:03,384 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:29:03,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:29:03,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:29:03,534 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:29:03,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:03,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:29:03,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:29:03,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 04:29:03,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:03,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:29:03,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 04:29:03,598 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 04:29:03,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:03,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:29:03,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:29:03,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:29:12,223 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 04:29:12,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:29:12,240 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=REPEATED_LIPTON_PN, 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;@81b05c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:29:12,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:29:12,245 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:29:12,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:12,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:12,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:12,248 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-06 04:29:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -384375228, now seen corresponding path program 1 times [2022-12-06 04:29:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:12,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768687863] [2022-12-06 04:29:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:12,474 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-06 04:29:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:12,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768687863] [2022-12-06 04:29:12,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768687863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:12,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:12,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579306394] [2022-12-06 04:29:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:29:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:29:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:29:12,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:29:12,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 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-06 04:29:12,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:12,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:29:12,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:12,771 INFO L130 PetriNetUnfolder]: 567/884 cut-off events. [2022-12-06 04:29:12,772 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:29:12,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 884 events. 567/884 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3659 event pairs, 567 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1784. Up to 865 conditions per place. [2022-12-06 04:29:12,783 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:29:12,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 85 flow [2022-12-06 04:29:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:29:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:29:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:29:12,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:29:12,793 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:29:12,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 85 flow [2022-12-06 04:29:12,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:29:12,797 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:12,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 04:29:12,801 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:29:12,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:12,802 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:12,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:12,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:12,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:29:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:12,815 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:29:12,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:12,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:29:12,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:12,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:29:13,017 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:13,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 04:29:13,019 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:29:13,019 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-06 04:29:13,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:13,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:29:13,019 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-06 04:29:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -17396267, now seen corresponding path program 1 times [2022-12-06 04:29:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:13,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173020926] [2022-12-06 04:29:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:13,354 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-06 04:29:13,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:13,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173020926] [2022-12-06 04:29:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173020926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:13,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473613615] [2022-12-06 04:29:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:13,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:13,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:13,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:13,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:29:13,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:29:13,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:13,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:29:13,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:13,540 INFO L130 PetriNetUnfolder]: 689/1044 cut-off events. [2022-12-06 04:29:13,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1044 events. 689/1044 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4390 event pairs, 185 based on Foata normal form. 8/1051 useless extension candidates. Maximal degree in co-relation 2122. Up to 979 conditions per place. [2022-12-06 04:29:13,546 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 04:29:13,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 136 flow [2022-12-06 04:29:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:29:13,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:29:13,547 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:29:13,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 136 flow [2022-12-06 04:29:13,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:29:13,548 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 04:29:13,549 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:29:13,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:13,549 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:13,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:13,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,556 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-06 04:29:13,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:13,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 43. Up to 10 conditions per place. [2022-12-06 04:29:13,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 04:29:13,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:13,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 04:29:13,662 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 04:29:13,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:29:13,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:13,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:13,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:29:13,663 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-06 04:29:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -539285889, now seen corresponding path program 1 times [2022-12-06 04:29:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394657763] [2022-12-06 04:29:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:13,962 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-06 04:29:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394657763] [2022-12-06 04:29:13,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394657763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:13,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:13,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244539272] [2022-12-06 04:29:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:13,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:13,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:29:13,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:29:13,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:13,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:29:13,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:14,175 INFO L130 PetriNetUnfolder]: 568/917 cut-off events. [2022-12-06 04:29:14,175 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-06 04:29:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 917 events. 568/917 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3920 event pairs, 155 based on Foata normal form. 12/925 useless extension candidates. Maximal degree in co-relation 2050. Up to 650 conditions per place. [2022-12-06 04:29:14,180 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:29:14,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 138 flow [2022-12-06 04:29:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:29:14,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:29:14,181 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:29:14,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 138 flow [2022-12-06 04:29:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:14,182 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 04:29:14,183 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 04:29:14,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:14,183 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:14,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:14,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,189 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-06 04:29:14,189 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:29:14,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-06 04:29:14,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 04:29:14,227 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:14,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:29:14,229 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 70 flow [2022-12-06 04:29:14,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:29:14,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:14,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:14,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:29:14,230 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-06 04:29:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1621493259, now seen corresponding path program 1 times [2022-12-06 04:29:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:14,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796845084] [2022-12-06 04:29:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:15,712 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-06 04:29:15,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796845084] [2022-12-06 04:29:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796845084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:15,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:15,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781799941] [2022-12-06 04:29:15,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:15,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:29:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:29:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:29:15,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:29:15,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-06 04:29:15,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:15,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:29:15,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:16,020 INFO L130 PetriNetUnfolder]: 764/1160 cut-off events. [2022-12-06 04:29:16,020 INFO L131 PetriNetUnfolder]: For 396/404 co-relation queries the response was YES. [2022-12-06 04:29:16,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1160 events. 764/1160 cut-off events. For 396/404 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4940 event pairs, 129 based on Foata normal form. 22/1165 useless extension candidates. Maximal degree in co-relation 2727. Up to 999 conditions per place. [2022-12-06 04:29:16,027 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:29:16,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 163 flow [2022-12-06 04:29:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:29:16,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:29:16,028 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 70 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:29:16,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 163 flow [2022-12-06 04:29:16,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:16,030 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:29:16,030 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:29:16,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:16,030 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:16,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:16,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,054 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-06 04:29:16,054 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:29:16,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 30 events. 3/30 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2022-12-06 04:29:16,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 04:29:16,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:16,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:29:16,057 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 74 flow [2022-12-06 04:29:16,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-06 04:29:16,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:16,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:16,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:29:16,058 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-06 04:29:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1274412280, now seen corresponding path program 1 times [2022-12-06 04:29:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:16,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610435001] [2022-12-06 04:29:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:16,583 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-06 04:29:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:16,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610435001] [2022-12-06 04:29:16,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610435001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:16,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:16,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691659383] [2022-12-06 04:29:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:16,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:16,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:29:16,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-06 04:29:16,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:16,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:29:16,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:16,848 INFO L130 PetriNetUnfolder]: 881/1340 cut-off events. [2022-12-06 04:29:16,848 INFO L131 PetriNetUnfolder]: For 485/485 co-relation queries the response was YES. [2022-12-06 04:29:16,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1340 events. 881/1340 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5728 event pairs, 567 based on Foata normal form. 15/1318 useless extension candidates. Maximal degree in co-relation 3259. Up to 1165 conditions per place. [2022-12-06 04:29:16,856 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-06 04:29:16,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 169 flow [2022-12-06 04:29:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 04:29:16,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 04:29:16,857 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 74 flow. Second operand 4 states and 35 transitions. [2022-12-06 04:29:16,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 169 flow [2022-12-06 04:29:16,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:16,859 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 113 flow [2022-12-06 04:29:16,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-06 04:29:16,860 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 04:29:16,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:16,860 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 113 flow [2022-12-06 04:29:16,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:16,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:16,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 113 flow [2022-12-06 04:29:16,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 113 flow [2022-12-06 04:29:16,886 INFO L130 PetriNetUnfolder]: 60/169 cut-off events. [2022-12-06 04:29:16,887 INFO L131 PetriNetUnfolder]: For 133/157 co-relation queries the response was YES. [2022-12-06 04:29:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 169 events. 60/169 cut-off events. For 133/157 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 805 event pairs, 28 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 376. Up to 95 conditions per place. [2022-12-06 04:29:16,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 113 flow [2022-12-06 04:29:16,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 04:29:16,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L760-->L778: Formula: (let ((.cse3 (= (mod v_~x$w_buff1_used~0_207 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_49 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_213 256) 0))) (let ((.cse14 (select |v_#memory_int_247| |v_~#x~0.base_172|)) (.cse2 (not .cse16)) (.cse4 (not .cse9)) (.cse8 (and .cse9 .cse5)) (.cse12 (and .cse9 .cse3)) (.cse15 (= (mod v_~weak$$choice2~0_104 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff1_used~0_206 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_212 256) 0)) (.cse7 (not .cse15)) (.cse1 (or .cse8 .cse12 .cse16)) (.cse6 (and .cse2 .cse4)) (.cse0 (select .cse14 |v_~#x~0.offset_172|))) (and (or (and (= .cse0 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EAX~0_18 |v_P0_#t~mem6_34|) .cse1) (and .cse2 (or (not .cse3) .cse4) (or (not .cse5) .cse4) (= (ite .cse6 v_~x$w_buff0~0_122 v_~x$w_buff1~0_100) v_~__unbuffered_p0_EAX~0_18) (= |v_P0_#t~mem6_34| |v_P0Thread1of1ForFork1_#t~mem6_1|))) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_63) (= v_~x$flush_delayed~0_82 0) (= (ite .cse7 v_~x$r_buff0_thd1~0_49 (ite (or .cse8 (and .cse9 .cse10) .cse11) v_~x$r_buff0_thd1~0_49 (ite (and (not .cse11) .cse4) 0 v_~x$r_buff0_thd1~0_49))) v_~x$r_buff0_thd1~0_48) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_104) (= v_~x$w_buff1~0_100 v_~x$w_buff1~0_99) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= (ite .cse7 v_~x$w_buff1_used~0_207 (ite (or .cse8 .cse12 .cse11) v_~x$w_buff1_used~0_207 0)) v_~x$w_buff1_used~0_206) (= (ite .cse7 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_48 256) 0))) (or (and .cse13 .cse10) (and .cse13 .cse5) .cse11)) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= (store |v_#memory_int_247| |v_~#x~0.base_172| (store .cse14 |v_~#x~0.offset_172| |v_P0_#t~ite10_33|)) |v_#memory_int_246|) (or (and .cse7 (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_40) (= |v_P0_#t~mem9_32| |v_P0Thread1of1ForFork1_#t~mem9_1|)) (and .cse15 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|) (= v_~__unbuffered_p0_EAX~0_18 |v_P0_#t~mem9_32|))) (= (ite .cse7 v_~x$w_buff0_used~0_213 (ite .cse1 v_~x$w_buff0_used~0_213 (ite .cse6 0 v_~x$w_buff0_used~0_213))) v_~x$w_buff0_used~0_212) (= v_~x$mem_tmp~0_40 .cse0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~#x~0.offset=|v_~#x~0.offset_172|, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_207, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_213, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_1|, #memory_int=|v_#memory_int_247|, ~#x~0.base=|v_~#x~0.base_172|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, ~x$flush_delayed~0=v_~x$flush_delayed~0_82, ~#x~0.offset=|v_~#x~0.offset_172|, ~x$w_buff1~0=v_~x$w_buff1~0_99, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_206, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_1|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212, ~weak$$choice0~0=v_~weak$$choice0~0_63, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, #memory_int=|v_#memory_int_246|, ~#x~0.base=|v_~#x~0.base_172|, ~weak$$choice2~0=v_~weak$$choice2~0_104} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] and [803] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= |v_#memory_int_476| (store |v_#memory_int_477| |v_~#x~0.base_280| (store (select |v_#memory_int_477| |v_~#x~0.base_280|) |v_~#x~0.offset_280| 1))) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_477|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_476|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:17,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L829-->L836: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_83 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd3~0_71 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_251 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_245 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_250 256) 0))) (.cse4 (not .cse9))) (let ((.cse2 (and .cse11 .cse4)) (.cse1 (not .cse8)) (.cse3 (select |v_#memory_int_291| |v_~#x~0.base_196|)) (.cse5 (not .cse10)) (.cse0 (not .cse7))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_245) v_~x$w_buff1_used~0_244) (= (store |v_#memory_int_291| |v_~#x~0.base_196| (store .cse3 |v_~#x~0.offset_196| |v_P2_#t~ite32_23|)) |v_#memory_int_290|) (= v_~x$r_buff0_thd3~0_82 (ite .cse2 0 v_~x$r_buff0_thd3~0_83)) (= v_~x$w_buff0_used~0_250 (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_251)) (let ((.cse6 (= |v_P2Thread1of1ForFork0_#t~mem30_1| |v_P2_#t~mem30_32|))) (or (and (or (and .cse6 .cse0 .cse1 (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_135)) (and (or .cse7 .cse8) (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_32|) (= (select .cse3 |v_~#x~0.offset_196|) |v_P2_#t~mem30_32|))) (or .cse9 .cse10) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_23|)) (and .cse6 .cse4 (= |v_P2_#t~ite32_23| v_~x$w_buff0~0_149) .cse5 (= |v_P2_#t~ite31_29| |v_P2Thread1of1ForFork0_#t~ite31_1|)))) (= v_~x$r_buff1_thd3~0_70 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse0) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_82 256) 0)))) 0 v_~x$r_buff1_thd3~0_71)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_149, ~#x~0.offset=|v_~#x~0.offset_196|, ~x$w_buff1~0=v_~x$w_buff1~0_135, #memory_int=|v_#memory_int_291|, ~#x~0.base=|v_~#x~0.base_196|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_83, P2Thread1of1ForFork0_#t~mem30=|v_P2Thread1of1ForFork0_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_251} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_149, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_196|, ~x$w_buff1~0=v_~x$w_buff1~0_135, #memory_int=|v_#memory_int_290|, ~#x~0.base=|v_~#x~0.base_196|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_70, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_82, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_250} AuxVars[|v_P2_#t~ite32_23|, |v_P2_#t~ite31_29|, |v_P2_#t~mem30_32|] AssignedVars[P2Thread1of1ForFork0_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite31, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0, P2Thread1of1ForFork0_#t~mem30] and [803] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= |v_#memory_int_476| (store |v_#memory_int_477| |v_~#x~0.base_280| (store (select |v_#memory_int_477| |v_~#x~0.base_280|) |v_~#x~0.offset_280| 1))) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_477|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_476|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:17,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] L856-3-->L858-2: Formula: (and (= |v_#pthreadsForks_47| |v_ULTIMATE.start_main_#t~pre37#1_25|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2126~0#1.base_22|) 0) (= |v_#valid_57| (store |v_#valid_58| |v_ULTIMATE.start_main_~#t2126~0#1.base_22| 1)) (not (= |v_ULTIMATE.start_main_~#t2126~0#1.base_22| 0)) (= 0 |v_ULTIMATE.start_main_~#t2126~0#1.offset_22|) (= (store |v_#memory_int_495| |v_ULTIMATE.start_main_~#t2126~0#1.base_22| (store (select |v_#memory_int_495| |v_ULTIMATE.start_main_~#t2126~0#1.base_22|) |v_ULTIMATE.start_main_~#t2126~0#1.offset_22| |v_ULTIMATE.start_main_#t~pre37#1_25|)) |v_#memory_int_494|) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t2126~0#1.base_22|) (= |v_#length_48| (store |v_#length_49| |v_ULTIMATE.start_main_~#t2126~0#1.base_22| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #pthreadsForks=|v_#pthreadsForks_47|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_495|, #length=|v_#length_49|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ULTIMATE.start_main_~#t2126~0#1.base=|v_ULTIMATE.start_main_~#t2126~0#1.base_22|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_19|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_11|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_494|, ULTIMATE.start_main_~#t2126~0#1.offset=|v_ULTIMATE.start_main_~#t2126~0#1.offset_22|, #length=|v_#length_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_~#t2126~0#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #valid, #memory_int, ULTIMATE.start_main_~#t2126~0#1.offset, #length] and [803] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= |v_#memory_int_476| (store |v_#memory_int_477| |v_~#x~0.base_280| (store (select |v_#memory_int_477| |v_~#x~0.base_280|) |v_~#x~0.offset_280| 1))) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_477|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_476|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:17,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L789-->L792: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] and [803] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= |v_#memory_int_476| (store |v_#memory_int_477| |v_~#x~0.base_280| (store (select |v_#memory_int_477| |v_~#x~0.base_280|) |v_~#x~0.offset_280| 1))) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_477|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_476|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:17,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L826: Formula: (let ((.cse2 (mod v_~x$w_buff0_used~0_323 256)) (.cse11 (mod v_~weak$$choice0~0_105 256)) (.cse13 (= (mod v_~x$w_buff0_used~0_322 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd3~0_125 256) 0))) (let ((.cse25 (= (mod v_~x$w_buff1_used~0_319 256) 0)) (.cse4 (not .cse6)) (.cse15 (not .cse13)) (.cse26 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse12 (select |v_#memory_int_387| |v_~#x~0.base_250|)) (.cse24 (= .cse11 0)) (.cse3 (= .cse2 0))) (let ((.cse16 (not (= (mod v_~x$w_buff1_used~0_318 256) 0))) (.cse5 (not .cse3)) (.cse10 (not .cse24)) (.cse0 (select .cse12 |v_~#x~0.offset_250|)) (.cse9 (= (mod v_~weak$$choice1~0_78 256) 0)) (.cse1 (not .cse26)) (.cse14 (and .cse4 .cse15)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_113 256) 0)) (.cse8 (not .cse25))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$mem_tmp~0_62 .cse0) (= (ite (= (ite .cse1 .cse2 (ite .cse3 .cse2 (ite (and .cse4 .cse5) 0 (ite (and .cse6 .cse5 .cse7 .cse8) (ite (or .cse9 .cse10) 1 0) .cse11)))) 0) 0 1) v_~x$w_buff0_used~0_322) (= |v_#memory_int_386| (store |v_#memory_int_387| |v_~#x~0.base_250| (store .cse12 |v_~#x~0.offset_250| |v_P2_#t~ite29_40|))) (= v_~x$w_buff0~0_208 v_~x$w_buff0~0_207) (= (ite .cse1 v_~x$r_buff0_thd3~0_125 (ite .cse13 v_~x$r_buff0_thd3~0_125 (ite .cse14 0 (ite (and .cse6 .cse15 .cse7 .cse16) v_~x$r_buff0_thd3~0_125 0)))) v_~x$r_buff0_thd3~0_124) (= (ite .cse1 v_~x$r_buff1_thd3~0_113 (ite .cse13 v_~x$r_buff1_thd3~0_113 (let ((.cse17 (= (mod v_~x$r_buff0_thd3~0_124 256) 0))) (ite (and (not .cse17) .cse15) 0 (ite (and .cse15 .cse7 .cse16 .cse17) (ite .cse10 v_~x$r_buff1_thd3~0_113 0) 0))))) v_~x$r_buff1_thd3~0_112) (= v_~x$w_buff1~0_194 v_~x$w_buff1~0_193) (= v_~__unbuffered_p2_EAX$read_delayed~0_47 1) (let ((.cse20 (= |v_P2_#t~ite24_60| |v_P2Thread1of1ForFork0_#t~ite24_14|)) (.cse23 (= |v_P2_#t~ite20_68| |v_P2Thread1of1ForFork0_#t~ite20_14|)) (.cse18 (= |v_P2_#t~ite22_80| |v_P2Thread1of1ForFork0_#t~ite22_14|)) (.cse19 (= |v_P2Thread1of1ForFork0_#t~mem21_14| |v_P2_#t~mem21_81|)) (.cse22 (= |v_P2_#t~ite23_74| |v_P2Thread1of1ForFork0_#t~ite23_14|)) (.cse21 (= |v_P2Thread1of1ForFork0_#t~mem19_14| |v_P2_#t~mem19_73|))) (or (and (= |v_P2_#t~ite25_52| |v_P2Thread1of1ForFork0_#t~ite25_14|) .cse3 .cse18 .cse19 .cse20 (= |v_P2_#t~mem18_41| v_~__unbuffered_p2_EAX~0_67) .cse21 .cse22 (= |v_P2_#t~mem18_41| .cse0) .cse23) (and (= |v_P2_#t~ite25_52| v_~__unbuffered_p2_EAX~0_67) .cse5 (or (and .cse4 .cse18 .cse19 .cse20 .cse21 (= |v_P2_#t~ite25_52| v_~x$w_buff0~0_208) .cse22 .cse23) (and .cse6 (= |v_P2_#t~ite24_60| |v_P2_#t~ite25_52|) (or (and (or (and (or (and .cse24 (= |v_P2_#t~ite22_80| |v_P2_#t~mem21_81|) (= |v_P2_#t~mem21_81| .cse0)) (and .cse10 (= |v_P2_#t~ite22_80| v_~x$w_buff0~0_208) .cse19)) .cse25 (= |v_P2_#t~ite22_80| |v_P2_#t~ite23_74|)) (and (= |v_P2_#t~ite23_74| (ite .cse10 v_~x$w_buff1~0_194 v_~x$w_buff0~0_208)) .cse18 .cse19 .cse8)) (= |v_P2_#t~ite24_60| |v_P2_#t~ite23_74|) (or (not .cse7) .cse25) .cse21 .cse23) (and (= |v_P2_#t~ite20_68| |v_P2_#t~ite24_60|) .cse18 .cse19 .cse7 .cse22 (or (and .cse10 (= |v_P2_#t~ite20_68| |v_P2_#t~mem19_73|) (= |v_P2_#t~mem19_73| .cse0)) (and .cse24 (= |v_P2_#t~ite20_68| (ite (not .cse9) v_~x$w_buff0~0_208 v_~x$w_buff1~0_194)) .cse21)) .cse8)))) (= |v_P2Thread1of1ForFork0_#t~mem18_14| |v_P2_#t~mem18_41|)))) (or (and (= |v_P2_#t~mem28_41| v_~__unbuffered_p2_EAX~0_67) (= |v_P2_#t~ite29_40| |v_P2_#t~mem28_41|) .cse26) (and (= |v_P2Thread1of1ForFork0_#t~mem28_14| |v_P2_#t~mem28_41|) (= |v_P2_#t~ite29_40| v_~x$mem_tmp~0_62) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= |v_~#x~0.base_250| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_48) (= |v_P2Thread1of1ForFork0_#t~nondet14_14| v_~weak$$choice0~0_105) (= v_~x$flush_delayed~0_110 0) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_14|) (= |v_~#x~0.offset_250| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_48) (= v_~x$w_buff1_used~0_318 (ite .cse1 v_~x$w_buff1_used~0_319 (ite .cse13 v_~x$w_buff1_used~0_319 (ite .cse14 0 (ite (and .cse6 .cse15 .cse7 .cse8) v_~weak$$choice0~0_105 0))))) (= |v_P2Thread1of1ForFork0_#t~nondet17_14| v_~weak$$choice1~0_78))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_208, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_14|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_250|, P2Thread1of1ForFork0_#t~mem18=|v_P2Thread1of1ForFork0_#t~mem18_14|, ~x$w_buff1~0=v_~x$w_buff1~0_194, P2Thread1of1ForFork0_#t~mem28=|v_P2Thread1of1ForFork0_#t~mem28_14|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_14|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_319, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_14|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_125, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_14|, P2Thread1of1ForFork0_#t~nondet17=|v_P2Thread1of1ForFork0_#t~nondet17_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_14|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_14|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_14|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_14|, #memory_int=|v_#memory_int_387|, ~#x~0.base=|v_~#x~0.base_250|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0_#t~mem21=|v_P2Thread1of1ForFork0_#t~mem21_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_207, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_110, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_48, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_48, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$mem_tmp~0=v_~x$mem_tmp~0_62, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_124, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_9|, ~weak$$choice1~0=v_~weak$$choice1~0_78, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_9|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#t~mem27=|v_P2Thread1of1ForFork0_#t~mem27_9|, ~#x~0.offset=|v_~#x~0.offset_250|, ~x$w_buff1~0=v_~x$w_buff1~0_193, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_318, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, ~weak$$choice0~0=v_~weak$$choice0~0_105, #memory_int=|v_#memory_int_386|, ~#x~0.base=|v_~#x~0.base_250|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[|v_P2_#t~mem21_81|, |v_P2_#t~mem19_73|, |v_P2_#t~ite25_52|, |v_P2_#t~mem28_41|, |v_P2_#t~ite23_74|, |v_P2_#t~ite29_40|, |v_P2_#t~ite20_68|, |v_P2_#t~ite22_80|, |v_P2_#t~ite24_60|, |v_P2_#t~mem18_41|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~mem18, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, P2Thread1of1ForFork0_#t~ite26, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite29, P2Thread1of1ForFork0_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem28, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, P2Thread1of1ForFork0_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem21] and [803] $Ultimate##0-->L789: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= |v_#memory_int_476| (store |v_#memory_int_477| |v_~#x~0.base_280| (store (select |v_#memory_int_477| |v_~#x~0.base_280|) |v_~#x~0.offset_280| 1))) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_477|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_280|, #memory_int=|v_#memory_int_476|, ~#x~0.base=|v_~#x~0.base_280|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 04:29:18,825 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:29:18,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:29:18,828 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:29:18,828 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 123 flow [2022-12-06 04:29:18,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:29:18,829 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:29:18,832 INFO L158 Benchmark]: Toolchain (without parser) took 17071.45ms. Allocated memory was 217.1MB in the beginning and 713.0MB in the end (delta: 496.0MB). Free memory was 192.5MB in the beginning and 565.4MB in the end (delta: -372.9MB). Peak memory consumption was 423.0MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,832 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory was 193.7MB in the beginning and 193.6MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:29:18,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.94ms. Allocated memory is still 217.1MB. Free memory was 192.0MB in the beginning and 162.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.37ms. Allocated memory is still 217.1MB. Free memory was 162.6MB in the beginning and 160.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,833 INFO L158 Benchmark]: Boogie Preprocessor took 54.11ms. Allocated memory is still 217.1MB. Free memory was 160.0MB in the beginning and 157.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,833 INFO L158 Benchmark]: RCFGBuilder took 947.56ms. Allocated memory was 217.1MB in the beginning and 285.2MB in the end (delta: 68.2MB). Free memory was 157.4MB in the beginning and 250.3MB in the end (delta: -92.9MB). Peak memory consumption was 92.7MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,833 INFO L158 Benchmark]: TraceAbstraction took 15466.21ms. Allocated memory was 285.2MB in the beginning and 713.0MB in the end (delta: 427.8MB). Free memory was 249.7MB in the beginning and 565.4MB in the end (delta: -315.7MB). Peak memory consumption was 411.0MB. Max. memory is 8.0GB. [2022-12-06 04:29:18,834 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.10ms. Allocated memory is still 217.1MB. Free memory was 193.7MB in the beginning and 193.6MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.94ms. Allocated memory is still 217.1MB. Free memory was 192.0MB in the beginning and 162.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.37ms. Allocated memory is still 217.1MB. Free memory was 162.6MB in the beginning and 160.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.11ms. Allocated memory is still 217.1MB. Free memory was 160.0MB in the beginning and 157.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 947.56ms. Allocated memory was 217.1MB in the beginning and 285.2MB in the end (delta: 68.2MB). Free memory was 157.4MB in the beginning and 250.3MB in the end (delta: -92.9MB). Peak memory consumption was 92.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15466.21ms. Allocated memory was 285.2MB in the beginning and 713.0MB in the end (delta: 427.8MB). Free memory was 249.7MB in the beginning and 565.4MB in the end (delta: -315.7MB). Peak memory consumption was 411.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 118 PlacesBefore, 30 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 772, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 694, independent: 661, independent conditional: 0, independent unconditional: 661, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 694, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 550, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 523, dependent conditional: 0, dependent unconditional: 523, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 818, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 694, unknown conditional: 0, unknown unconditional: 694] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 973, Positive conditional cache size: 0, Positive unconditional cache size: 973, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 27 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 9, independent unconditional: 30, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 13, independent unconditional: 20, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 30, independent conditional: 11, independent unconditional: 19, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 30, independent conditional: 2, independent unconditional: 28, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 30, independent conditional: 2, independent unconditional: 28, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 30, independent conditional: 2, independent unconditional: 28, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 84, independent conditional: 58, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 84, independent conditional: 12, independent unconditional: 72, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 84, independent conditional: 12, independent unconditional: 72, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 72, independent conditional: 7, independent unconditional: 65, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 74, Positive conditional cache size: 5, Positive unconditional cache size: 69, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:29:18,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...