/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:32:06,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:32:06,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:32:06,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:32:06,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:32:06,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:32:06,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:32:06,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:32:06,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:32:06,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:32:06,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:32:06,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:32:06,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:32:06,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:32:06,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:32:06,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:32:06,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:32:06,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:32:06,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:32:06,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:32:06,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:32:06,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:32:06,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:32:06,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:32:06,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:32:06,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:32:06,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:32:06,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:32:06,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:32:06,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:32:06,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:32:06,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:32:06,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:32:06,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:32:06,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:32:06,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:32:06,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:32:06,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:32:06,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:32:06,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:32:06,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:32:06,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:32:06,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:32:06,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:32:06,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:32:06,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:32:06,108 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:32:06,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:32:06,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:32:06,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:32:06,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:32:06,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:32:06,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:32:06,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:32:06,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:32:06,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:32:06,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:32:06,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:32:06,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:32:06,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:32:06,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:32:06,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:32:06,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:32:06,436 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:32:06,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:32:07,645 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:32:07,921 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:32:07,922 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:32:07,944 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab73c103/8b5e543d9fd64672a61d4bbbe0cc7047/FLAG87bb23fb2 [2022-12-06 04:32:07,955 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab73c103/8b5e543d9fd64672a61d4bbbe0cc7047 [2022-12-06 04:32:07,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:32:07,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:32:07,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:32:07,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:32:07,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:32:07,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:07" (1/1) ... [2022-12-06 04:32:07,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b0a4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:07, skipping insertion in model container [2022-12-06 04:32:07,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:07" (1/1) ... [2022-12-06 04:32:07,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:32:08,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:32:08,157 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 04:32:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:32:08,374 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:32:08,388 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 04:32:08,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:08,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:08,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:32:08,461 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:32:08,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08 WrapperNode [2022-12-06 04:32:08,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:32:08,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:32:08,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:32:08,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:32:08,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,526 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-06 04:32:08,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:32:08,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:32:08,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:32:08,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:32:08,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,561 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:32:08,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:32:08,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:32:08,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:32:08,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (1/1) ... [2022-12-06 04:32:08,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:32:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:32:08,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:32:08,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:32:08,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:32:08,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:32:08,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:32:08,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:32:08,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:32:08,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:32:08,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:32:08,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:32:08,656 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:32:08,764 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:32:08,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:32:09,061 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:32:09,181 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:32:09,182 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:32:09,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:09 BoogieIcfgContainer [2022-12-06 04:32:09,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:32:09,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:32:09,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:32:09,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:32:09,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:32:07" (1/3) ... [2022-12-06 04:32:09,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44772253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:09, skipping insertion in model container [2022-12-06 04:32:09,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:08" (2/3) ... [2022-12-06 04:32:09,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44772253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:09, skipping insertion in model container [2022-12-06 04:32:09,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:09" (3/3) ... [2022-12-06 04:32:09,189 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:32:09,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:32:09,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:32:09,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:32:09,242 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:32:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 186 flow [2022-12-06 04:32:09,291 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-06 04:32:09,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:09,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 04:32:09,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 88 transitions, 186 flow [2022-12-06 04:32:09,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 178 flow [2022-12-06 04:32:09,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:09,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-06 04:32:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 178 flow [2022-12-06 04:32:09,326 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-06 04:32:09,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 04:32:09,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-06 04:32:09,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-06 04:32:12,581 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-06 04:32:12,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:32:12,597 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;@4511eec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:32:12,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:32:12,599 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:32:12,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:12,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:12,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:32:12,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 393835, now seen corresponding path program 1 times [2022-12-06 04:32:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:12,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572159328] [2022-12-06 04:32:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572159328] [2022-12-06 04:32:12,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572159328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:12,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:12,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960103208] [2022-12-06 04:32:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:12,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:12,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:32:12,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:12,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:12,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:32:12,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:13,026 INFO L130 PetriNetUnfolder]: 176/342 cut-off events. [2022-12-06 04:32:13,026 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:32:13,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 342 events. 176/342 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1500 event pairs, 20 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 655. Up to 256 conditions per place. [2022-12-06 04:32:13,029 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 21 selfloop transitions, 2 changer transitions 6/30 dead transitions. [2022-12-06 04:32:13,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 127 flow [2022-12-06 04:32:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:32:13,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 04:32:13,047 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:32:13,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 127 flow [2022-12-06 04:32:13,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:13,052 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 38 flow [2022-12-06 04:32:13,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2022-12-06 04:32:13,057 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 04:32:13,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:13,058 INFO L89 Accepts]: Start accepts. Operand has 25 places, 15 transitions, 38 flow [2022-12-06 04:32:13,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:13,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:13,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 15 transitions, 38 flow [2022-12-06 04:32:13,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 04:32:13,067 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:32:13,067 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:13,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:32:13,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 04:32:13,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 04:32:13,134 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:13,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 04:32:13,136 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 04:32:13,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:13,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:32:13,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1336288199, now seen corresponding path program 1 times [2022-12-06 04:32:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061935756] [2022-12-06 04:32:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:13,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061935756] [2022-12-06 04:32:13,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061935756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:13,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:13,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191338605] [2022-12-06 04:32:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:13,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:13,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:13,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:13,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:32:13,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:13,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:32:13,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:13,399 INFO L130 PetriNetUnfolder]: 104/191 cut-off events. [2022-12-06 04:32:13,400 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 04:32:13,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 191 events. 104/191 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 654 event pairs, 24 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 405. Up to 157 conditions per place. [2022-12-06 04:32:13,404 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-06 04:32:13,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 88 flow [2022-12-06 04:32:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 04:32:13,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 04:32:13,407 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-06 04:32:13,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 88 flow [2022-12-06 04:32:13,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:13,408 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-06 04:32:13,409 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-06 04:32:13,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:13,409 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:13,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:13,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,412 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:32:13,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:13,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:32:13,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 04:32:13,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:13,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:32:13,455 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-06 04:32:13,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:13,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:32:13,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1524737180, now seen corresponding path program 1 times [2022-12-06 04:32:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295932297] [2022-12-06 04:32:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:13,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295932297] [2022-12-06 04:32:13,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295932297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:13,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:13,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376619865] [2022-12-06 04:32:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:13,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:13,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:32:13,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:13,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:32:13,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:13,644 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2022-12-06 04:32:13,644 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 04:32:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 256 events. 143/256 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 854 event pairs, 21 based on Foata normal form. 5/261 useless extension candidates. Maximal degree in co-relation 566. Up to 135 conditions per place. [2022-12-06 04:32:13,646 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 04:32:13,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 151 flow [2022-12-06 04:32:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:32:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:32:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-06 04:32:13,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 04:32:13,648 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 35 transitions. [2022-12-06 04:32:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 151 flow [2022-12-06 04:32:13,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 33 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:13,650 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 04:32:13,652 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-06 04:32:13,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:13,654 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:13,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:13,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,662 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-06 04:32:13,662 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-06 04:32:13,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 2/25 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2022-12-06 04:32:13,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:32:13,704 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:13,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:32:13,705 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 73 flow [2022-12-06 04:32:13,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:13,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:32:13,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -30866061, now seen corresponding path program 1 times [2022-12-06 04:32:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:13,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559722876] [2022-12-06 04:32:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:13,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559722876] [2022-12-06 04:32:13,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559722876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:13,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:13,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890499487] [2022-12-06 04:32:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:13,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:32:13,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 73 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:13,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:13,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:32:13,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:13,927 INFO L130 PetriNetUnfolder]: 160/294 cut-off events. [2022-12-06 04:32:13,927 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 04:32:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 294 events. 160/294 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1055 event pairs, 59 based on Foata normal form. 15/309 useless extension candidates. Maximal degree in co-relation 736. Up to 114 conditions per place. [2022-12-06 04:32:13,929 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 20 selfloop transitions, 3 changer transitions 8/31 dead transitions. [2022-12-06 04:32:13,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 161 flow [2022-12-06 04:32:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 04:32:13,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:32:13,930 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 73 flow. Second operand 4 states and 32 transitions. [2022-12-06 04:32:13,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 161 flow [2022-12-06 04:32:13,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:32:13,933 INFO L231 Difference]: Finished difference. Result has 32 places, 15 transitions, 68 flow [2022-12-06 04:32:13,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2022-12-06 04:32:13,934 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 04:32:13,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:13,934 INFO L89 Accepts]: Start accepts. Operand has 32 places, 15 transitions, 68 flow [2022-12-06 04:32:13,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:13,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:13,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 15 transitions, 68 flow [2022-12-06 04:32:13,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 15 transitions, 68 flow [2022-12-06 04:32:13,939 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:32:13,939 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:32:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 15 events. 0/15 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:32:13,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 15 transitions, 68 flow [2022-12-06 04:32:13,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 04:32:14,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:32:14,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 04:32:14,048 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 14 transitions, 66 flow [2022-12-06 04:32:14,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:14,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:14,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:14,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:32:14,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1851719854, now seen corresponding path program 1 times [2022-12-06 04:32:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:14,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126159925] [2022-12-06 04:32:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126159925] [2022-12-06 04:32:14,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126159925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:14,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:14,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644903919] [2022-12-06 04:32:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:14,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:32:14,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 14 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:14,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:14,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:32:14,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:14,183 INFO L130 PetriNetUnfolder]: 31/76 cut-off events. [2022-12-06 04:32:14,184 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 04:32:14,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 76 events. 31/76 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 178 event pairs, 10 based on Foata normal form. 9/85 useless extension candidates. Maximal degree in co-relation 229. Up to 54 conditions per place. [2022-12-06 04:32:14,184 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-06 04:32:14,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 137 flow [2022-12-06 04:32:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 04:32:14,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:32:14,186 INFO L175 Difference]: Start difference. First operand has 30 places, 14 transitions, 66 flow. Second operand 3 states and 23 transitions. [2022-12-06 04:32:14,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 137 flow [2022-12-06 04:32:14,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 102 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-12-06 04:32:14,187 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-06 04:32:14,188 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-06 04:32:14,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:14,188 INFO L89 Accepts]: Start accepts. Operand has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:14,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:14,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,192 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-06 04:32:14,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:14,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 24 events. 3/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 1 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 40. Up to 10 conditions per place. [2022-12-06 04:32:14,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 04:32:14,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:14,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 04:32:14,194 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 57 flow [2022-12-06 04:32:14,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:14,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:14,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:32:14,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 349994048, now seen corresponding path program 1 times [2022-12-06 04:32:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62151553] [2022-12-06 04:32:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62151553] [2022-12-06 04:32:14,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62151553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:14,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:14,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:32:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743337695] [2022-12-06 04:32:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:14,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:14,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:32:14,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:14,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:14,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:32:14,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:14,358 INFO L130 PetriNetUnfolder]: 14/42 cut-off events. [2022-12-06 04:32:14,359 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 04:32:14,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 42 events. 14/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 7 based on Foata normal form. 6/48 useless extension candidates. Maximal degree in co-relation 114. Up to 23 conditions per place. [2022-12-06 04:32:14,359 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 17 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2022-12-06 04:32:14,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 117 flow [2022-12-06 04:32:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-06 04:32:14,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 04:32:14,360 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 57 flow. Second operand 4 states and 23 transitions. [2022-12-06 04:32:14,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 117 flow [2022-12-06 04:32:14,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 109 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:14,361 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 66 flow [2022-12-06 04:32:14,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 04:32:14,361 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-06 04:32:14,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:14,362 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 66 flow [2022-12-06 04:32:14,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:14,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:14,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 66 flow [2022-12-06 04:32:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 16 transitions, 66 flow [2022-12-06 04:32:14,365 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 04:32:14,365 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:32:14,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 16 events. 1/16 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 04:32:14,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 16 transitions, 66 flow [2022-12-06 04:32:14,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 04:32:15,058 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:32:15,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 698 [2022-12-06 04:32:15,060 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 13 transitions, 60 flow [2022-12-06 04:32:15,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:15,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:15,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:32:15,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 415343357, now seen corresponding path program 1 times [2022-12-06 04:32:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763117973] [2022-12-06 04:32:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:15,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763117973] [2022-12-06 04:32:15,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763117973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:15,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:15,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:32:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314151847] [2022-12-06 04:32:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:32:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:32:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:32:15,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-06 04:32:15,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 13 transitions, 60 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:15,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:15,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-06 04:32:15,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:15,656 INFO L130 PetriNetUnfolder]: 13/42 cut-off events. [2022-12-06 04:32:15,656 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 04:32:15,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 42 events. 13/42 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 3 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 125. Up to 16 conditions per place. [2022-12-06 04:32:15,657 INFO L137 encePairwiseOnDemand]: 5/11 looper letters, 12 selfloop transitions, 3 changer transitions 11/26 dead transitions. [2022-12-06 04:32:15,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 173 flow [2022-12-06 04:32:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:32:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:32:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-12-06 04:32:15,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2987012987012987 [2022-12-06 04:32:15,658 INFO L175 Difference]: Start difference. First operand has 23 places, 13 transitions, 60 flow. Second operand 7 states and 23 transitions. [2022-12-06 04:32:15,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 173 flow [2022-12-06 04:32:15,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 153 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:15,660 INFO L231 Difference]: Finished difference. Result has 30 places, 13 transitions, 64 flow [2022-12-06 04:32:15,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=13} [2022-12-06 04:32:15,660 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 04:32:15,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:15,660 INFO L89 Accepts]: Start accepts. Operand has 30 places, 13 transitions, 64 flow [2022-12-06 04:32:15,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:15,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:15,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 13 transitions, 64 flow [2022-12-06 04:32:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 13 transitions, 64 flow [2022-12-06 04:32:15,664 INFO L130 PetriNetUnfolder]: 1/13 cut-off events. [2022-12-06 04:32:15,664 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:32:15,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 13 events. 1/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-06 04:32:15,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 13 transitions, 64 flow [2022-12-06 04:32:15,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 04:32:15,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] $Ultimate##0-->L750: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| 0)) (= |v_P0Thread1of1ForFork1_~arg#1.offset_43| |v_P0Thread1of1ForFork1_#in~arg#1.offset_43|) (= v_~y$r_buff0_thd1~0_171 v_~y$r_buff1_thd1~0_117) (= v_~y$w_buff0_used~0_382 1) (= v_~y$r_buff0_thd0~0_154 v_~y$r_buff1_thd0~0_152) (= v_~y$w_buff1~0_198 v_~y$w_buff0~0_239) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_382 256) 0)) (not (= (mod v_~y$w_buff1_used~0_337 256) 0)))) 1 0)) (= v_~y$r_buff0_thd1~0_170 1) (= |v_P0Thread1of1ForFork1_~arg#1.base_43| |v_P0Thread1of1ForFork1_#in~arg#1.base_43|) (= v_~y$w_buff0~0_238 1) (= v_~x~0_47 1) (= v_~y$r_buff0_thd2~0_211 v_~y$r_buff1_thd2~0_221) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$w_buff0_used~0_383 v_~y$w_buff1_used~0_337)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_239, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_171, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_211, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_43|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_382, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_43|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_43|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_43|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_43|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_221, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_198, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_238, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_170, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_211, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47|, ~x~0=v_~x~0_47, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_152, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_337} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [381] $Ultimate##0-->L783: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd2~0_224 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_214 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_354 256) 0) .cse10)) (.cse9 (and .cse10 .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_401 256) 0))) (let ((.cse2 (or .cse8 .cse9 .cse12)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~y~0_283 (ite .cse3 v_~y$w_buff0~0_249 v_~y$w_buff1~0_207))) (.cse0 (not (= (mod v_~weak$$choice2~0_70 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_353 256) 0)) (.cse7 (= (mod v_~y$w_buff0_used~0_400 256) 0))) (and (= 0 v_~y$flush_delayed~0_59) (= v_~y~0_282 (ite .cse0 v_~y$mem_tmp~0_54 .cse1)) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~y$w_buff0_used~0_400 (ite .cse0 v_~y$w_buff0_used~0_401 (ite .cse2 v_~y$w_buff0_used~0_401 (ite .cse3 0 v_~y$w_buff0_used~0_401)))) (= v_~y~0_283 v_~y$mem_tmp~0_54) (= |v_P1Thread1of1ForFork0_#t~nondet4_58| v_~weak$$choice2~0_70) (= (ite .cse0 v_~y$r_buff1_thd2~0_224 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd2~0_213 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~y$r_buff1_thd2~0_224 0)) v_~y$r_buff1_thd2~0_223) (= v_~y$w_buff0~0_249 v_~y$w_buff0~0_248) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= .cse1 v_~__unbuffered_p1_EBX~0_89) (= |v_P1Thread1of1ForFork0_#t~nondet3_58| v_~weak$$choice0~0_41) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$w_buff1_used~0_353 (ite .cse0 v_~y$w_buff1_used~0_354 (ite (or .cse8 .cse9 .cse7) v_~y$w_buff1_used~0_354 0))) (= v_~x~0_49 v_~__unbuffered_p1_EAX~0_69) (= v_~y$r_buff0_thd2~0_213 (ite .cse0 v_~y$r_buff0_thd2~0_214 (ite (or (and .cse10 .cse5) .cse9 .cse7) v_~y$r_buff0_thd2~0_214 (ite (and .cse11 (not .cse7)) 0 v_~y$r_buff0_thd2~0_214))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_58|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_401, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$w_buff0~0=v_~y$w_buff0~0_249, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_214, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_58|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_283, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_354} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_89, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_400, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_54, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_248, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_213, ~y$flush_delayed~0=v_~y$flush_delayed~0_59, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_282, ~weak$$choice2~0=v_~weak$$choice2~0_70, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_353} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:32:16,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:32:16,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 447 [2022-12-06 04:32:16,107 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 12 transitions, 60 flow [2022-12-06 04:32:16,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:32:16,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:16,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:16,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:32:16,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:32:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1049880666, now seen corresponding path program 1 times [2022-12-06 04:32:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:16,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298572482] [2022-12-06 04:32:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:16,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:32:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:16,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:32:16,192 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:32:16,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:32:16,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 04:32:16,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:32:16,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:32:16,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 04:32:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:32:16,195 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:16,198 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:32:16,198 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:32:16,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:32:16 BasicIcfg [2022-12-06 04:32:16,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:32:16,250 INFO L158 Benchmark]: Toolchain (without parser) took 8292.00ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 152.9MB in the beginning and 159.0MB in the end (delta: -6.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,250 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:32:16,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.93ms. Allocated memory is still 178.3MB. Free memory was 152.4MB in the beginning and 127.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.39ms. Allocated memory is still 178.3MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,250 INFO L158 Benchmark]: Boogie Preprocessor took 37.74ms. Allocated memory is still 178.3MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,250 INFO L158 Benchmark]: RCFGBuilder took 618.47ms. Allocated memory is still 178.3MB. Free memory was 123.5MB in the beginning and 92.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,251 INFO L158 Benchmark]: TraceAbstraction took 7064.18ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 91.6MB in the beginning and 159.0MB in the end (delta: -67.4MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2022-12-06 04:32:16,251 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.13ms. Allocated memory is still 178.3MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.93ms. Allocated memory is still 178.3MB. Free memory was 152.4MB in the beginning and 127.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.39ms. Allocated memory is still 178.3MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.74ms. Allocated memory is still 178.3MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 618.47ms. Allocated memory is still 178.3MB. Free memory was 123.5MB in the beginning and 92.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7064.18ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 91.6MB in the beginning and 159.0MB in the end (delta: -67.4MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 91 PlacesBefore, 27 PlacesAfterwards, 86 TransitionsBefore, 21 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 899, independent: 855, independent conditional: 855, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 899, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 899, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 899, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 696, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 696, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 899, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 696, unknown conditional: 0, unknown unconditional: 696] , Statistics on independence cache: Total cache size (in pairs): 1131, Positive cache size: 1104, Positive conditional cache size: 0, Positive unconditional cache size: 1104, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 29, independent conditional: 29, 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: 45, independent: 29, independent conditional: 8, independent unconditional: 21, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 29, independent conditional: 8, independent unconditional: 21, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 29, independent conditional: 8, independent unconditional: 21, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 28, independent conditional: 8, independent unconditional: 20, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 36, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 41, unknown conditional: 14, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 28, Positive conditional cache size: 8, Positive unconditional cache size: 20, Negative cache size: 13, Negative conditional cache size: 6, Negative unconditional cache size: 7, 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, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 5, independent unconditional: 21, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 34, Positive conditional cache size: 8, Positive unconditional cache size: 26, Negative cache size: 19, Negative conditional cache size: 6, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 41, Positive conditional cache size: 8, Positive unconditional cache size: 33, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, 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.1s, 31 PlacesBefore, 30 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 48, Positive conditional cache size: 8, Positive unconditional cache size: 40, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 48, Positive conditional cache size: 8, Positive unconditional cache size: 40, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, 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.7s, 26 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 14, independent conditional: 1, independent unconditional: 13, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 1, independent unconditional: 13, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 14, independent conditional: 1, independent unconditional: 13, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 49, Positive conditional cache size: 8, Positive unconditional cache size: 41, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, 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.4s, 27 PlacesBefore, 25 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 50, Positive conditional cache size: 8, Positive unconditional cache size: 42, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-1, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 [L749] 1 x = 1 [L766] 1 __unbuffered_p1_EAX = x [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 y$flush_delayed = weak$$choice2 [L772] 1 y$mem_tmp = y [L773] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 1 __unbuffered_p1_EBX = y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 106 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=3, InterpolantAutomatonStates: 29, 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, 1.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:32:16,272 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...