/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:53:43,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:53:43,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:53:43,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:53:43,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:53:43,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:53:43,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:53:43,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:53:43,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:53:43,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:53:43,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:53:43,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:53:43,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:53:43,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:53:43,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:53:43,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:53:43,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:53:43,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:53:43,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:53:43,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:53:43,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:53:43,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:53:43,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:53:43,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:53:43,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:53:43,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:53:43,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:53:43,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:53:43,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:53:43,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:53:43,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:53:43,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:53:43,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:53:43,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:53:43,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:53:43,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:53:43,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:53:43,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:53:43,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:53:43,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:53:43,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:53:43,329 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-RepeatedSemanticLbe.epf [2022-12-13 00:53:43,352 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:53:43,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:53:43,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:53:43,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:53:43,354 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:53:43,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:53:43,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:53:43,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:53:43,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:53:43,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:53:43,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:53:43,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:43,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:53:43,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:53:43,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:53:43,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:53:43,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:53:43,358 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-13 00:53:43,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:53:43,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:53:43,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:53:43,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:53:43,632 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:53:43,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:53:44,572 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:53:44,796 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:53:44,797 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:53:44,805 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81481d73c/a8026a9d1fd34400b32af31a89328341/FLAG807a10f44 [2022-12-13 00:53:44,820 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81481d73c/a8026a9d1fd34400b32af31a89328341 [2022-12-13 00:53:44,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:53:44,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:53:44,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:44,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:53:44,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:53:44,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:44" (1/1) ... [2022-12-13 00:53:44,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c047ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:44, skipping insertion in model container [2022-12-13 00:53:44,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:44" (1/1) ... [2022-12-13 00:53:44,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:53:44,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:53:45,015 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 00:53:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:45,209 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:53:45,217 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 00:53:45,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:45,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:45,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:45,303 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:53:45,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45 WrapperNode [2022-12-13 00:53:45,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:45,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:45,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:53:45,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:53:45,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,365 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-13 00:53:45,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:45,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:53:45,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:53:45,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:53:45,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,397 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:53:45,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:53:45,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:53:45,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:53:45,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (1/1) ... [2022-12-13 00:53:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:53:45,437 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-13 00:53:45,496 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-13 00:53:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:53:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:53:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:53:45,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:53:45,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:53:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:53:45,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:53:45,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:53:45,511 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:53:45,654 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:53:45,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:53:45,894 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:53:45,980 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:53:45,980 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:53:45,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:45 BoogieIcfgContainer [2022-12-13 00:53:45,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:53:45,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:53:45,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:53:45,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:53:45,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:53:44" (1/3) ... [2022-12-13 00:53:45,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b04f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:45, skipping insertion in model container [2022-12-13 00:53:45,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:45" (2/3) ... [2022-12-13 00:53:45,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b04f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:45, skipping insertion in model container [2022-12-13 00:53:45,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:45" (3/3) ... [2022-12-13 00:53:45,987 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:53:46,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:53:46,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:53:46,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:53:46,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:53:46,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 00:53:46,113 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 00:53:46,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:53:46,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 00:53:46,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-13 00:53:46,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:46,137 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 00:53:46,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-13 00:53:46,166 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 00:53:46,166 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:46,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:53:46,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 00:53:46,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 00:53:52,262 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 00:53:52,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:53:52,287 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;@19e1d424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:53:52,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:53:52,291 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 00:53:52,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:52,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:52,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:53:52,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash 392250014, now seen corresponding path program 1 times [2022-12-13 00:53:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:52,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967953638] [2022-12-13 00:53:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:52,672 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-13 00:53:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:52,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967953638] [2022-12-13 00:53:52,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967953638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:52,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:52,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503289560] [2022-12-13 00:53:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:52,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:52,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 00:53:52,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:52,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:52,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 00:53:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:53,054 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-13 00:53:53,055 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:53:53,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 11914 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-13 00:53:53,063 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-13 00:53:53,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-13 00:53:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 00:53:53,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-13 00:53:53,075 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-13 00:53:53,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 268 flow [2022-12-13 00:53:53,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:53,079 INFO L231 Difference]: Finished difference. Result has 49 places, 22 transitions, 52 flow [2022-12-13 00:53:53,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2022-12-13 00:53:53,083 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 00:53:53,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:53,084 INFO L89 Accepts]: Start accepts. Operand has 49 places, 22 transitions, 52 flow [2022-12-13 00:53:53,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:53,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:53,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 22 transitions, 52 flow [2022-12-13 00:53:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2022-12-13 00:53:53,094 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 00:53:53,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 45 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:53:53,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 52 flow [2022-12-13 00:53:53,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 00:53:53,180 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:53,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 00:53:53,181 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2022-12-13 00:53:53,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:53,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:53,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:53:53,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1004781460, now seen corresponding path program 1 times [2022-12-13 00:53:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:53,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694237217] [2022-12-13 00:53:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:53,356 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-13 00:53:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694237217] [2022-12-13 00:53:53,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694237217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:53,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:53,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100514375] [2022-12-13 00:53:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:53,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:53,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:53:53,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 00:53:53,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:53,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:53:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:53,413 INFO L130 PetriNetUnfolder]: 171/334 cut-off events. [2022-12-13 00:53:53,414 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 00:53:53,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 334 events. 171/334 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1417 event pairs, 75 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 659. Up to 290 conditions per place. [2022-12-13 00:53:53,417 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-13 00:53:53,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 116 flow [2022-12-13 00:53:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-13 00:53:53,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 00:53:53,420 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-13 00:53:53,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 116 flow [2022-12-13 00:53:53,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:53,421 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-13 00:53:53,421 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -21 predicate places. [2022-12-13 00:53:53,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:53,421 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:53,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:53,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,426 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 00:53:53,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:53,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2022-12-13 00:53:53,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 00:53:53,441 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:53,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 00:53:53,443 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 67 flow [2022-12-13 00:53:53,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 00:53:53,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:53,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:53,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:53:53,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1083455298, now seen corresponding path program 1 times [2022-12-13 00:53:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:53,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249233073] [2022-12-13 00:53:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:53,722 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-13 00:53:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:53,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249233073] [2022-12-13 00:53:53,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249233073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:53,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:53,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:53:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612969729] [2022-12-13 00:53:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:53,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 00:53:53,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 00:53:53,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:53,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 00:53:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:53,810 INFO L130 PetriNetUnfolder]: 265/467 cut-off events. [2022-12-13 00:53:53,810 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-13 00:53:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 467 events. 265/467 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1923 event pairs, 106 based on Foata normal form. 7/350 useless extension candidates. Maximal degree in co-relation 1019. Up to 398 conditions per place. [2022-12-13 00:53:53,812 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-13 00:53:53,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 154 flow [2022-12-13 00:53:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 00:53:53,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2022-12-13 00:53:53,814 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 67 flow. Second operand 4 states and 47 transitions. [2022-12-13 00:53:53,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 154 flow [2022-12-13 00:53:53,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:53,815 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 00:53:53,817 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -17 predicate places. [2022-12-13 00:53:53,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:53,819 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:53,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:53,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,831 INFO L130 PetriNetUnfolder]: 5/57 cut-off events. [2022-12-13 00:53:53,831 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 00:53:53,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 57 events. 5/57 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 218 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 85. Up to 14 conditions per place. [2022-12-13 00:53:53,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 00:53:53,855 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:53,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 00:53:53,856 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 87 flow [2022-12-13 00:53:53,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 00:53:53,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:53,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:53:53,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1917384275, now seen corresponding path program 1 times [2022-12-13 00:53:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:53,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623506477] [2022-12-13 00:53:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:54,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623506477] [2022-12-13 00:53:54,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623506477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:54,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:54,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622239547] [2022-12-13 00:53:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:54,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:54,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:53:54,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:53:54,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:54,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:53:54,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:54,271 INFO L130 PetriNetUnfolder]: 171/335 cut-off events. [2022-12-13 00:53:54,272 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-13 00:53:54,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 335 events. 171/335 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1372 event pairs, 109 based on Foata normal form. 3/285 useless extension candidates. Maximal degree in co-relation 815. Up to 277 conditions per place. [2022-12-13 00:53:54,274 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 22 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-13 00:53:54,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 167 flow [2022-12-13 00:53:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 00:53:54,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2022-12-13 00:53:54,275 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 87 flow. Second operand 4 states and 51 transitions. [2022-12-13 00:53:54,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 167 flow [2022-12-13 00:53:54,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:54,277 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-13 00:53:54,277 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2022-12-13 00:53:54,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:54,277 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:54,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:54,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,284 INFO L130 PetriNetUnfolder]: 11/62 cut-off events. [2022-12-13 00:53:54,284 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 00:53:54,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 62 events. 11/62 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 228 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 120. Up to 19 conditions per place. [2022-12-13 00:53:54,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 00:53:54,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:54,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 00:53:54,311 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 109 flow [2022-12-13 00:53:54,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:53:54,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:54,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:54,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:53:54,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -733100946, now seen corresponding path program 1 times [2022-12-13 00:53:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:54,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41495530] [2022-12-13 00:53:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:54,907 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-13 00:53:54,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:54,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41495530] [2022-12-13 00:53:54,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41495530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:54,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:54,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024505746] [2022-12-13 00:53:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:54,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:54,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:54,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 00:53:54,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-13 00:53:54,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:54,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 00:53:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:55,036 INFO L130 PetriNetUnfolder]: 198/371 cut-off events. [2022-12-13 00:53:55,036 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-13 00:53:55,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 371 events. 198/371 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1454 event pairs, 49 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 984. Up to 291 conditions per place. [2022-12-13 00:53:55,038 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 34 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2022-12-13 00:53:55,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 293 flow [2022-12-13 00:53:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:53:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:53:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-13 00:53:55,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.512987012987013 [2022-12-13 00:53:55,040 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 109 flow. Second operand 7 states and 79 transitions. [2022-12-13 00:53:55,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 293 flow [2022-12-13 00:53:55,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:55,042 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 200 flow [2022-12-13 00:53:55,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 00:53:55,042 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2022-12-13 00:53:55,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:55,042 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 200 flow [2022-12-13 00:53:55,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:55,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:55,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 200 flow [2022-12-13 00:53:55,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 200 flow [2022-12-13 00:53:55,053 INFO L130 PetriNetUnfolder]: 34/125 cut-off events. [2022-12-13 00:53:55,053 INFO L131 PetriNetUnfolder]: For 126/127 co-relation queries the response was YES. [2022-12-13 00:53:55,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 125 events. 34/125 cut-off events. For 126/127 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 574 event pairs, 11 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 301. Up to 33 conditions per place. [2022-12-13 00:53:55,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 200 flow [2022-12-13 00:53:55,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 00:53:55,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:53:55,297 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:53:55,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 00:53:55,298 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 211 flow [2022-12-13 00:53:55,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-13 00:53:55,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:55,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:55,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:53:55,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 787213552, now seen corresponding path program 2 times [2022-12-13 00:53:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:55,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087145587] [2022-12-13 00:53:55,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:55,530 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-13 00:53:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:55,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087145587] [2022-12-13 00:53:55,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087145587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:55,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:55,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:55,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414791505] [2022-12-13 00:53:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:55,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:53:55,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:55,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:55,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:53:55,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:55,658 INFO L130 PetriNetUnfolder]: 182/347 cut-off events. [2022-12-13 00:53:55,658 INFO L131 PetriNetUnfolder]: For 627/630 co-relation queries the response was YES. [2022-12-13 00:53:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 347 events. 182/347 cut-off events. For 627/630 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1477 event pairs, 94 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 1159. Up to 272 conditions per place. [2022-12-13 00:53:55,660 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 33 selfloop transitions, 13 changer transitions 0/53 dead transitions. [2022-12-13 00:53:55,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 368 flow [2022-12-13 00:53:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 00:53:55,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 00:53:55,662 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 211 flow. Second operand 5 states and 65 transitions. [2022-12-13 00:53:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 368 flow [2022-12-13 00:53:55,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 360 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 00:53:55,668 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 00:53:55,670 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 00:53:55,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:55,670 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:55,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:55,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,685 INFO L130 PetriNetUnfolder]: 40/133 cut-off events. [2022-12-13 00:53:55,685 INFO L131 PetriNetUnfolder]: For 255/265 co-relation queries the response was YES. [2022-12-13 00:53:55,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 133 events. 40/133 cut-off events. For 255/265 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 616 event pairs, 7 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 381. Up to 36 conditions per place. [2022-12-13 00:53:55,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 00:53:55,687 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:55,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 00:53:55,687 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 282 flow [2022-12-13 00:53:55,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:55,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:55,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:55,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:53:55,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -732706936, now seen corresponding path program 1 times [2022-12-13 00:53:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:55,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849849398] [2022-12-13 00:53:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:56,028 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-13 00:53:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849849398] [2022-12-13 00:53:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849849398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:56,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457123229] [2022-12-13 00:53:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:56,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:56,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:53:56,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-13 00:53:56,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:56,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:53:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:56,140 INFO L130 PetriNetUnfolder]: 211/400 cut-off events. [2022-12-13 00:53:56,141 INFO L131 PetriNetUnfolder]: For 1138/1141 co-relation queries the response was YES. [2022-12-13 00:53:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 400 events. 211/400 cut-off events. For 1138/1141 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1742 event pairs, 91 based on Foata normal form. 5/344 useless extension candidates. Maximal degree in co-relation 1505. Up to 313 conditions per place. [2022-12-13 00:53:56,143 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 38 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2022-12-13 00:53:56,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 460 flow [2022-12-13 00:53:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 00:53:56,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 00:53:56,144 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 282 flow. Second operand 5 states and 64 transitions. [2022-12-13 00:53:56,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 460 flow [2022-12-13 00:53:56,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 450 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 00:53:56,147 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 00:53:56,147 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-13 00:53:56,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:56,147 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:56,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:56,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,161 INFO L130 PetriNetUnfolder]: 49/151 cut-off events. [2022-12-13 00:53:56,161 INFO L131 PetriNetUnfolder]: For 526/540 co-relation queries the response was YES. [2022-12-13 00:53:56,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 151 events. 49/151 cut-off events. For 526/540 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 720 event pairs, 6 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 556. Up to 48 conditions per place. [2022-12-13 00:53:56,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 00:53:56,163 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:56,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 00:53:56,164 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 369 flow [2022-12-13 00:53:56,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-13 00:53:56,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:56,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:56,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:53:56,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -31146635, now seen corresponding path program 1 times [2022-12-13 00:53:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:56,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100142882] [2022-12-13 00:53:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:56,372 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-13 00:53:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100142882] [2022-12-13 00:53:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100142882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:56,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:56,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547118683] [2022-12-13 00:53:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:56,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 00:53:56,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 00:53:56,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:56,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 00:53:56,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:56,512 INFO L130 PetriNetUnfolder]: 329/643 cut-off events. [2022-12-13 00:53:56,512 INFO L131 PetriNetUnfolder]: For 2614/2614 co-relation queries the response was YES. [2022-12-13 00:53:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 643 events. 329/643 cut-off events. For 2614/2614 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3195 event pairs, 91 based on Foata normal form. 26/573 useless extension candidates. Maximal degree in co-relation 2542. Up to 331 conditions per place. [2022-12-13 00:53:56,515 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 43 selfloop transitions, 7 changer transitions 14/69 dead transitions. [2022-12-13 00:53:56,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 619 flow [2022-12-13 00:53:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 00:53:56,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 00:53:56,517 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 369 flow. Second operand 4 states and 54 transitions. [2022-12-13 00:53:56,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 619 flow [2022-12-13 00:53:56,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 586 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:56,523 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 298 flow [2022-12-13 00:53:56,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-12-13 00:53:56,525 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2022-12-13 00:53:56,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:56,525 INFO L89 Accepts]: Start accepts. Operand has 58 places, 43 transitions, 298 flow [2022-12-13 00:53:56,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:56,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:56,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 43 transitions, 298 flow [2022-12-13 00:53:56,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 298 flow [2022-12-13 00:53:56,540 INFO L130 PetriNetUnfolder]: 49/183 cut-off events. [2022-12-13 00:53:56,540 INFO L131 PetriNetUnfolder]: For 559/571 co-relation queries the response was YES. [2022-12-13 00:53:56,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 183 events. 49/183 cut-off events. For 559/571 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1000 event pairs, 9 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 599. Up to 56 conditions per place. [2022-12-13 00:53:56,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 298 flow [2022-12-13 00:53:56,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 00:53:56,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:53:56,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:56,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 00:53:56,737 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 296 flow [2022-12-13 00:53:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-13 00:53:56,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:56,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:56,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:53:56,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 829663402, now seen corresponding path program 3 times [2022-12-13 00:53:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725875390] [2022-12-13 00:53:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:56,944 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-13 00:53:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725875390] [2022-12-13 00:53:56,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725875390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:56,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:56,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618792347] [2022-12-13 00:53:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:56,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:56,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:53:56,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:56,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:56,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:53:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:57,072 INFO L130 PetriNetUnfolder]: 272/555 cut-off events. [2022-12-13 00:53:57,072 INFO L131 PetriNetUnfolder]: For 2172/2179 co-relation queries the response was YES. [2022-12-13 00:53:57,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 555 events. 272/555 cut-off events. For 2172/2179 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2793 event pairs, 77 based on Foata normal form. 13/474 useless extension candidates. Maximal degree in co-relation 2135. Up to 361 conditions per place. [2022-12-13 00:53:57,076 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 29 selfloop transitions, 15 changer transitions 9/60 dead transitions. [2022-12-13 00:53:57,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 478 flow [2022-12-13 00:53:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:53:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:53:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-12-13 00:53:57,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2022-12-13 00:53:57,078 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 296 flow. Second operand 7 states and 89 transitions. [2022-12-13 00:53:57,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 478 flow [2022-12-13 00:53:57,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 455 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:57,084 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 307 flow [2022-12-13 00:53:57,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2022-12-13 00:53:57,084 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2022-12-13 00:53:57,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:57,085 INFO L89 Accepts]: Start accepts. Operand has 59 places, 40 transitions, 307 flow [2022-12-13 00:53:57,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:57,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:57,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 40 transitions, 307 flow [2022-12-13 00:53:57,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 40 transitions, 307 flow [2022-12-13 00:53:57,100 INFO L130 PetriNetUnfolder]: 37/155 cut-off events. [2022-12-13 00:53:57,101 INFO L131 PetriNetUnfolder]: For 506/506 co-relation queries the response was YES. [2022-12-13 00:53:57,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 155 events. 37/155 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 838 event pairs, 11 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 563. Up to 47 conditions per place. [2022-12-13 00:53:57,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 307 flow [2022-12-13 00:53:57,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 00:53:57,105 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [400] $Ultimate##0-->L745: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_588 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd1~0_219 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_590 256) 0))) (let ((.cse2 (and .cse1 (not .cse4))) (.cse0 (and .cse1 .cse3))) (and (= v_~x$r_buff0_thd1~0_218 (ite .cse0 0 v_~x$r_buff0_thd1~0_219)) (= (ite .cse1 v_~x$w_buff0~0_400 (ite .cse2 v_~x$w_buff1~0_361 v_~x~0_491)) v_~x~0_490) (= v_~x$r_buff0_thd2~0_175 v_~x$r_buff1_thd2~0_124) (= v_~x$w_buff0~0_401 v_~x$w_buff1~0_361) (= v_~x$r_buff0_thd0~0_352 v_~x$r_buff1_thd0~0_360) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_36| |v_P1Thread1of1ForFork0_~arg#1.offset_36|) (= v_~x$w_buff0_used~0_588 (ite .cse1 0 1)) (= v_~x$r_buff1_thd1~0_222 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_218 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_545 256) 0)) .cse1)) 0 v_~x$r_buff0_thd1~0_219)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44| 0)) (= (ite (or .cse2 .cse0) 0 v_~x$w_buff0_used~0_590) v_~x$w_buff1_used~0_545) (= 2 v_~x$w_buff0~0_400) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|) (= v_~x$r_buff0_thd2~0_174 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_36| |v_P1Thread1of1ForFork0_#in~arg#1.base_36|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_352, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_36|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_219, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_175, ~x~0=v_~x~0_491, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_36|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_590} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_352, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_44|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_36|, ~x$w_buff1~0=v_~x$w_buff1~0_361, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_545, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_222, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_44|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_174, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_360, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_36|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_588, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_36|, ~x~0=v_~x~0_490} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:53:57,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:53:57,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:53:57,341 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 00:53:57,342 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:57,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 00:53:57,343 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 326 flow [2022-12-13 00:53:57,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:57,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:57,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:57,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:53:57,343 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash -935884811, now seen corresponding path program 1 times [2022-12-13 00:53:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:57,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144775325] [2022-12-13 00:53:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:57,595 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-13 00:53:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:57,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144775325] [2022-12-13 00:53:57,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144775325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:57,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:57,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276843724] [2022-12-13 00:53:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:57,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:57,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:57,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 00:53:57,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:57,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:57,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 00:53:57,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:57,685 INFO L130 PetriNetUnfolder]: 190/424 cut-off events. [2022-12-13 00:53:57,685 INFO L131 PetriNetUnfolder]: For 1903/1915 co-relation queries the response was YES. [2022-12-13 00:53:57,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 424 events. 190/424 cut-off events. For 1903/1915 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2165 event pairs, 145 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1660. Up to 366 conditions per place. [2022-12-13 00:53:57,687 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 24 selfloop transitions, 3 changer transitions 6/40 dead transitions. [2022-12-13 00:53:57,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 40 transitions, 347 flow [2022-12-13 00:53:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 3 states and 40 transitions. [2022-12-13 00:53:57,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 00:53:57,688 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 326 flow. Second operand 3 states and 40 transitions. [2022-12-13 00:53:57,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 40 transitions, 347 flow [2022-12-13 00:53:57,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 40 transitions, 307 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 00:53:57,692 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 214 flow [2022-12-13 00:53:57,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2022-12-13 00:53:57,693 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-12-13 00:53:57,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:57,693 INFO L89 Accepts]: Start accepts. Operand has 55 places, 34 transitions, 214 flow [2022-12-13 00:53:57,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:57,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:57,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 34 transitions, 214 flow [2022-12-13 00:53:57,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 34 transitions, 214 flow [2022-12-13 00:53:57,703 INFO L130 PetriNetUnfolder]: 21/132 cut-off events. [2022-12-13 00:53:57,703 INFO L131 PetriNetUnfolder]: For 281/283 co-relation queries the response was YES. [2022-12-13 00:53:57,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 132 events. 21/132 cut-off events. For 281/283 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 753 event pairs, 9 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 368. Up to 34 conditions per place. [2022-12-13 00:53:57,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 34 transitions, 214 flow [2022-12-13 00:53:57,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 00:53:58,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 00:53:58,996 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:53:58,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1304 [2022-12-13 00:53:58,997 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 224 flow [2022-12-13 00:53:58,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:58,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:58,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:58,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:53:58,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1257789864, now seen corresponding path program 1 times [2022-12-13 00:53:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:58,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011950047] [2022-12-13 00:53:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:59,407 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-13 00:53:59,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011950047] [2022-12-13 00:53:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011950047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:59,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615692388] [2022-12-13 00:53:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:59,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:59,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:53:59,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:59,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:59,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:53:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:59,504 INFO L130 PetriNetUnfolder]: 154/373 cut-off events. [2022-12-13 00:53:59,504 INFO L131 PetriNetUnfolder]: For 1714/1723 co-relation queries the response was YES. [2022-12-13 00:53:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 373 events. 154/373 cut-off events. For 1714/1723 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2033 event pairs, 58 based on Foata normal form. 16/307 useless extension candidates. Maximal degree in co-relation 1270. Up to 223 conditions per place. [2022-12-13 00:53:59,506 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 23 selfloop transitions, 7 changer transitions 4/39 dead transitions. [2022-12-13 00:53:59,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 39 transitions, 306 flow [2022-12-13 00:53:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 00:53:59,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 00:53:59,508 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 224 flow. Second operand 5 states and 57 transitions. [2022-12-13 00:53:59,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 39 transitions, 306 flow [2022-12-13 00:53:59,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 271 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 00:53:59,510 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 186 flow [2022-12-13 00:53:59,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2022-12-13 00:53:59,511 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-13 00:53:59,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:59,511 INFO L89 Accepts]: Start accepts. Operand has 47 places, 29 transitions, 186 flow [2022-12-13 00:53:59,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:59,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:59,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 186 flow [2022-12-13 00:53:59,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 29 transitions, 186 flow [2022-12-13 00:53:59,519 INFO L130 PetriNetUnfolder]: 9/70 cut-off events. [2022-12-13 00:53:59,519 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-13 00:53:59,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 70 events. 9/70 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 301 event pairs, 4 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 208. Up to 20 conditions per place. [2022-12-13 00:53:59,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 29 transitions, 186 flow [2022-12-13 00:53:59,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 00:53:59,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:53:59,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] $Ultimate##0-->L766: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= v_~x$r_buff0_thd1~0_232 v_~x$r_buff1_thd1~0_234) (= v_~x$r_buff0_thd2~0_191 v_~x$r_buff1_thd2~0_134) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_567 256) 0)) (not (= (mod v_~x$w_buff0_used~0_616 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= v_~y~0_141 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_42| |v_P1Thread1of1ForFork0_~arg#1.offset_42|) (= v_~x$r_buff0_thd0~0_364 v_~x$r_buff1_thd0~0_372) (= v_~x$w_buff0_used~0_616 1) (= 2 v_~x$w_buff0~0_420) (= |v_P1Thread1of1ForFork0_~arg#1.base_42| |v_P1Thread1of1ForFork0_#in~arg#1.base_42|) (= v_~x$w_buff0_used~0_617 v_~x$w_buff1_used~0_567) (= v_~x$r_buff0_thd2~0_190 1) (= v_~x$w_buff0~0_421 v_~x$w_buff1~0_375) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_421, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_191, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_617} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_420, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_42|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_567, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_234, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_190, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_372, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~y~0=v_~y~0_141} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [306] L2-1-->L804: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd0~0_76 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_76 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd0~0_75 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_123 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_75 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_76)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_124) v_~x$w_buff1_used~0_123) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_76) v_~x$r_buff0_thd0~0_75) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_80 (ite .cse3 v_~x$w_buff1~0_64 v_~x~0_82))) (= v_~x$w_buff0_used~0_143 (ite .cse4 0 v_~x$w_buff0_used~0_144))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~x$w_buff1~0=v_~x$w_buff1~0_64, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_76, ~x~0=v_~x~0_82, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_64, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_123, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_75, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:53:59,950 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:59,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 440 [2022-12-13 00:53:59,951 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 215 flow [2022-12-13 00:53:59,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-13 00:53:59,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:59,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:59,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:53:59,952 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:53:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 775660214, now seen corresponding path program 1 times [2022-12-13 00:53:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:59,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436234440] [2022-12-13 00:53:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:00,014 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-13 00:54:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:00,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436234440] [2022-12-13 00:54:00,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436234440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:00,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:00,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206909767] [2022-12-13 00:54:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:00,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:00,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 00:54:00,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 00:54:00,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:00,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 00:54:00,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:00,057 INFO L130 PetriNetUnfolder]: 64/156 cut-off events. [2022-12-13 00:54:00,057 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2022-12-13 00:54:00,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 156 events. 64/156 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 598 event pairs, 21 based on Foata normal form. 8/115 useless extension candidates. Maximal degree in co-relation 557. Up to 136 conditions per place. [2022-12-13 00:54:00,058 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 20 selfloop transitions, 7 changer transitions 2/32 dead transitions. [2022-12-13 00:54:00,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 32 transitions, 236 flow [2022-12-13 00:54:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-13 00:54:00,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 00:54:00,060 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 215 flow. Second operand 3 states and 36 transitions. [2022-12-13 00:54:00,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 32 transitions, 236 flow [2022-12-13 00:54:00,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 193 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-12-13 00:54:00,062 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 153 flow [2022-12-13 00:54:00,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2022-12-13 00:54:00,063 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-12-13 00:54:00,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:00,063 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 153 flow [2022-12-13 00:54:00,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:00,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:00,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 153 flow [2022-12-13 00:54:00,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 153 flow [2022-12-13 00:54:00,071 INFO L130 PetriNetUnfolder]: 34/110 cut-off events. [2022-12-13 00:54:00,071 INFO L131 PetriNetUnfolder]: For 193/202 co-relation queries the response was YES. [2022-12-13 00:54:00,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 110 events. 34/110 cut-off events. For 193/202 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 458 event pairs, 15 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 324. Up to 76 conditions per place. [2022-12-13 00:54:00,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 153 flow [2022-12-13 00:54:00,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 00:54:00,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] $Ultimate##0-->L766: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= v_~x$r_buff0_thd1~0_232 v_~x$r_buff1_thd1~0_234) (= v_~x$r_buff0_thd2~0_191 v_~x$r_buff1_thd2~0_134) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_567 256) 0)) (not (= (mod v_~x$w_buff0_used~0_616 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= v_~y~0_141 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_42| |v_P1Thread1of1ForFork0_~arg#1.offset_42|) (= v_~x$r_buff0_thd0~0_364 v_~x$r_buff1_thd0~0_372) (= v_~x$w_buff0_used~0_616 1) (= 2 v_~x$w_buff0~0_420) (= |v_P1Thread1of1ForFork0_~arg#1.base_42| |v_P1Thread1of1ForFork0_#in~arg#1.base_42|) (= v_~x$w_buff0_used~0_617 v_~x$w_buff1_used~0_567) (= v_~x$r_buff0_thd2~0_190 1) (= v_~x$w_buff0~0_421 v_~x$w_buff1~0_375) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_421, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_191, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_617} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_420, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_42|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_567, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_234, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_190, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_372, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~y~0=v_~y~0_141} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [330] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:54:00,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:54:00,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:54:00,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] $Ultimate##0-->L773: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff0_thd2~0_200 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_632 256) 0)) (.cse2 (not (= (mod v_~x$w_buff0_used~0_630 256) 0)))) (and (= (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~x$w_buff0_used~0_632) v_~x$w_buff1_used~0_577) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0~0_431 v_~x$w_buff1~0_381) (= v_~x$r_buff0_thd0~0_370 v_~x$r_buff1_thd0~0_378) (= v_~x$r_buff0_thd1~0_240 v_~x$r_buff1_thd1~0_242) (= v_~y~0_145 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0_used~0_630 0) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_198 256) 0)) .cse2) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_577 256) 0)))) 0 v_~x$r_buff0_thd2~0_200) v_~x$r_buff1_thd2~0_138) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_46| |v_P1Thread1of1ForFork0_~arg#1.offset_46|) (= 2 v_~x$w_buff0~0_430) (= v_~x$w_buff0~0_430 v_~x~0_528) (= |v_P1Thread1of1ForFork0_~arg#1.base_46| |v_P1Thread1of1ForFork0_#in~arg#1.base_46|) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (= v_~x$r_buff0_thd2~0_198 (ite .cse2 0 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_431, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_370, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_240, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_632} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_430, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_370, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_240, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_46|, ~x$w_buff1~0=v_~x$w_buff1~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_138, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_242, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_198, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_378, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_630, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~y~0=v_~y~0_145, ~x~0=v_~x~0_528} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0, ~x~0] and [330] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:54:00,891 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 00:54:01,108 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:54:01,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1046 [2022-12-13 00:54:01,109 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 123 flow [2022-12-13 00:54:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 00:54:01,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:01,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:01,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:54:01,109 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1082701011, now seen corresponding path program 1 times [2022-12-13 00:54:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854365472] [2022-12-13 00:54:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:01,203 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-13 00:54:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854365472] [2022-12-13 00:54:01,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854365472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:01,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:01,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580552982] [2022-12-13 00:54:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:01,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:01,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 00:54:01,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 00:54:01,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:01,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 00:54:01,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:01,210 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-13 00:54:01,210 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 00:54:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 6 events. 0/6 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/6 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 00:54:01,210 INFO L137 encePairwiseOnDemand]: 17/18 looper letters, 0 selfloop transitions, 0 changer transitions 6/6 dead transitions. [2022-12-13 00:54:01,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 6 transitions, 43 flow [2022-12-13 00:54:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 2 states and 7 transitions. [2022-12-13 00:54:01,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19444444444444445 [2022-12-13 00:54:01,211 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 123 flow. Second operand 2 states and 7 transitions. [2022-12-13 00:54:01,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 6 transitions, 43 flow [2022-12-13 00:54:01,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 6 transitions, 28 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-12-13 00:54:01,211 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2022-12-13 00:54:01,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2022-12-13 00:54:01,212 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -36 predicate places. [2022-12-13 00:54:01,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:01,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 0 transitions, 0 flow [2022-12-13 00:54:01,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:01,212 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:54:01,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 00:54:01,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:01,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:54:01,213 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:01,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 00:54:01,213 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:01,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 00:54:01,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:54:01,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:54:01,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:54:01,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:54:01,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:54:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:54:01,216 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:01,219 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:01,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:01,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:01 BasicIcfg [2022-12-13 00:54:01,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:01,221 INFO L158 Benchmark]: Toolchain (without parser) took 16396.89ms. Allocated memory was 216.0MB in the beginning and 649.1MB in the end (delta: 433.1MB). Free memory was 190.6MB in the beginning and 384.1MB in the end (delta: -193.5MB). Peak memory consumption was 239.4MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory was 192.0MB in the beginning and 191.9MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.92ms. Allocated memory is still 216.0MB. Free memory was 190.6MB in the beginning and 165.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.02ms. Allocated memory is still 216.0MB. Free memory was 165.8MB in the beginning and 163.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 216.0MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: RCFGBuilder took 581.01ms. Allocated memory is still 216.0MB. Free memory was 161.1MB in the beginning and 130.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,222 INFO L158 Benchmark]: TraceAbstraction took 15237.70ms. Allocated memory was 216.0MB in the beginning and 649.1MB in the end (delta: 433.1MB). Free memory was 129.1MB in the beginning and 384.1MB in the end (delta: -255.0MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. [2022-12-13 00:54:01,223 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.11ms. Allocated memory is still 216.0MB. Free memory was 192.0MB in the beginning and 191.9MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.92ms. Allocated memory is still 216.0MB. Free memory was 190.6MB in the beginning and 165.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.02ms. Allocated memory is still 216.0MB. Free memory was 165.8MB in the beginning and 163.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 216.0MB. Free memory was 163.2MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 581.01ms. Allocated memory is still 216.0MB. Free memory was 161.1MB in the beginning and 130.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15237.70ms. Allocated memory was 216.0MB in the beginning and 649.1MB in the end (delta: 433.1MB). Free memory was 129.1MB in the beginning and 384.1MB in the end (delta: -255.0MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 89 PlacesBefore, 51 PlacesAfterwards, 84 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1733, independent: 1602, independent conditional: 1602, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1733, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1733, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1733, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 965, independent: 914, independent conditional: 0, independent unconditional: 914, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 965, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 413, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 399, dependent conditional: 0, dependent unconditional: 399, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1733, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 965, unknown conditional: 0, unknown unconditional: 965] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1657, Positive conditional cache size: 0, Positive unconditional cache size: 1657, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, 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, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 6, independent unconditional: 108, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 114, independent conditional: 6, independent unconditional: 108, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 6, independent unconditional: 108, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 92, independent conditional: 6, independent unconditional: 86, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 68, dependent conditional: 5, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 110, unknown conditional: 7, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 92, Positive conditional cache size: 6, Positive unconditional cache size: 86, Negative cache size: 18, Negative conditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 81, independent conditional: 3, independent unconditional: 78, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 106, Positive conditional cache size: 6, Positive unconditional cache size: 100, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 45, 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: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 45, independent conditional: 3, independent unconditional: 42, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 3, independent unconditional: 42, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 113, Positive conditional cache size: 9, Positive unconditional cache size: 104, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 2, independent unconditional: 44, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 11, dependent conditional: 6, dependent unconditional: 5, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 6, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 113, Positive conditional cache size: 9, Positive unconditional cache size: 104, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 129, Positive conditional cache size: 11, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 18, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 129, Positive conditional cache size: 11, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 18, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 129, Positive conditional cache size: 11, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 21, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 131, Positive conditional cache size: 12, Positive unconditional cache size: 119, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 59 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 18, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 34, independent: 26, independent conditional: 5, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 151, Positive conditional cache size: 13, Positive unconditional cache size: 138, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 51 PlacesBefore, 50 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 18, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 32, independent: 25, independent conditional: 6, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 161, Positive conditional cache size: 13, Positive unconditional cache size: 148, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 45 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 23, independent conditional: 10, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 10, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 25, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 180, Positive conditional cache size: 16, Positive unconditional cache size: 164, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 37 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 21 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 31, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 18, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 18, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 46, independent: 37, independent conditional: 15, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 221, Positive conditional cache size: 19, Positive unconditional cache size: 202, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 221, Positive conditional cache size: 19, Positive unconditional cache size: 202, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 773 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 16 mSDtfsCounter, 773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 1006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 00:54:01,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...