/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:00:08,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:00:08,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:00:08,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:00:08,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:00:08,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:00:08,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:00:08,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:00:08,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:00:08,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:00:08,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:00:08,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:00:08,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:00:08,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:00:08,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:00:08,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:00:08,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:00:08,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:00:08,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:00:08,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:00:08,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:00:08,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:00:08,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:00:08,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:00:08,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:00:08,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:00:08,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:00:08,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:00:08,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:00:08,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:00:08,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:00:08,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:00:08,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:00:08,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:00:08,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:00:08,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:00:08,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:00:08,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:00:08,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:00:08,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:00:08,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:00:08,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:00:08,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:00:08,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:00:08,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:00:08,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:00:08,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:00:08,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:00:08,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:00:08,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:00:08,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:00:08,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:00:08,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:00:08,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:00:08,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:00:08,724 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:00:08,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-12-05 23:00:09,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:00:09,847 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:00:09,847 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-12-05 23:00:09,878 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf771d3d/8e56ee07c7374c41b0f2a2aecb395f6d/FLAG0ecd4822b [2022-12-05 23:00:09,903 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf771d3d/8e56ee07c7374c41b0f2a2aecb395f6d [2022-12-05 23:00:09,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:00:09,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:00:09,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:00:09,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:00:09,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:00:09,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:00:09" (1/1) ... [2022-12-05 23:00:09,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcd6782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:09, skipping insertion in model container [2022-12-05 23:00:09,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:00:09" (1/1) ... [2022-12-05 23:00:09,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:00:09,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:00:10,067 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/mix035_power.opt_rmo.opt.i[1001,1014] [2022-12-05 23:00:10,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:00:10,169 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:00:10,177 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/mix035_power.opt_rmo.opt.i[1001,1014] [2022-12-05 23:00:10,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:00:10,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:00:10,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:00:10,230 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:00:10,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10 WrapperNode [2022-12-05 23:00:10,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:00:10,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:00:10,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:00:10,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:00:10,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,262 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-05 23:00:10,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:00:10,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:00:10,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:00:10,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:00:10,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:00:10,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:00:10,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:00:10,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:00:10,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (1/1) ... [2022-12-05 23:00:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:00:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:00:10,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:00:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:00:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:00:10,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:00:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:00:10,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:00:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:00:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:00:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:00:10,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:00:10,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:00:10,334 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:00:10,475 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:00:10,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:00:10,727 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:00:10,819 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:00:10,819 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:00:10,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:00:10 BoogieIcfgContainer [2022-12-05 23:00:10,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:00:10,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:00:10,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:00:10,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:00:10,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:00:09" (1/3) ... [2022-12-05 23:00:10,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb67fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:00:10, skipping insertion in model container [2022-12-05 23:00:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:00:10" (2/3) ... [2022-12-05 23:00:10,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb67fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:00:10, skipping insertion in model container [2022-12-05 23:00:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:00:10" (3/3) ... [2022-12-05 23:00:10,826 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-12-05 23:00:10,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:00:10,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:00:10,842 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:00:10,886 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:00:10,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 23:00:10,967 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 23:00:10,967 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:00:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 23:00:10,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 23:00:10,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-05 23:00:10,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:10,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 23:00:11,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-05 23:00:11,024 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 23:00:11,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:00:11,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 23:00:11,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 23:00:11,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-05 23:00:14,767 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-05 23:00:14,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:00:14,791 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;@21e1f7f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:00:14,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:00:14,794 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:00:14,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:00:14,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:14,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:00:14,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 451356282, now seen corresponding path program 1 times [2022-12-05 23:00:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150911110] [2022-12-05 23:00:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150911110] [2022-12-05 23:00:15,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150911110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:15,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:00:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900010016] [2022-12-05 23:00:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:15,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:00:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:15,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:00:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:00:15,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 23:00:15,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-05 23:00:15,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:15,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 23:00:15,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:15,475 INFO L130 PetriNetUnfolder]: 1103/1784 cut-off events. [2022-12-05 23:00:15,475 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:00:15,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1784 events. 1103/1784 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9191 event pairs, 182 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 3460. Up to 1318 conditions per place. [2022-12-05 23:00:15,486 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 6/39 dead transitions. [2022-12-05 23:00:15,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 164 flow [2022-12-05 23:00:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:00:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:00:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 23:00:15,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-05 23:00:15,496 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 48 transitions. [2022-12-05 23:00:15,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 164 flow [2022-12-05 23:00:15,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:00:15,500 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-05 23:00:15,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:00:15,504 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:00:15,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:15,505 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-05 23:00:15,510 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:15,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:15,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-05 23:00:15,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 23:00:15,516 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:00:15,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:00:15,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:00:15,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 23:00:15,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-05 23:00:15,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:00:15,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-05 23:00:15,660 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:00:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-05 23:00:15,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:15,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:15,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:00:15,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1913413824, now seen corresponding path program 1 times [2022-12-05 23:00:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104830455] [2022-12-05 23:00:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104830455] [2022-12-05 23:00:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104830455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:15,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:15,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:00:15,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140870317] [2022-12-05 23:00:15,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:15,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:00:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:15,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:00:15,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:00:15,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:00:15,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) 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-05 23:00:15,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:15,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:00:15,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:16,046 INFO L130 PetriNetUnfolder]: 897/1342 cut-off events. [2022-12-05 23:00:16,046 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 23:00:16,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1342 events. 897/1342 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5243 event pairs, 365 based on Foata normal form. 4/1346 useless extension candidates. Maximal degree in co-relation 2814. Up to 1299 conditions per place. [2022-12-05 23:00:16,052 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 27 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2022-12-05 23:00:16,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 140 flow [2022-12-05 23:00:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:00:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:00:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 23:00:16,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 23:00:16,068 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-05 23:00:16,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 140 flow [2022-12-05 23:00:16,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:00:16,071 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-05 23:00:16,071 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-12-05 23:00:16,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:16,071 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,072 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:16,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:16,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,079 INFO L130 PetriNetUnfolder]: 14/65 cut-off events. [2022-12-05 23:00:16,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:00:16,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 65 events. 14/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 212 event pairs, 6 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 98. Up to 29 conditions per place. [2022-12-05 23:00:16,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-05 23:00:16,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:00:16,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-05 23:00:16,115 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 72 flow [2022-12-05 23:00:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-05 23:00:16,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:16,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:16,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:00:16,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash -813713029, now seen corresponding path program 1 times [2022-12-05 23:00:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198136206] [2022-12-05 23:00:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:16,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198136206] [2022-12-05 23:00:16,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198136206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:16,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:16,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:00:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081667730] [2022-12-05 23:00:16,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:16,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:00:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:00:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:00:16,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:00:16,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:16,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:16,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:00:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:16,423 INFO L130 PetriNetUnfolder]: 519/865 cut-off events. [2022-12-05 23:00:16,423 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-05 23:00:16,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 865 events. 519/865 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3925 event pairs, 96 based on Foata normal form. 78/928 useless extension candidates. Maximal degree in co-relation 1973. Up to 507 conditions per place. [2022-12-05 23:00:16,426 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 6 changer transitions 13/57 dead transitions. [2022-12-05 23:00:16,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 57 transitions, 270 flow [2022-12-05 23:00:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:00:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:00:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-05 23:00:16,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-05 23:00:16,429 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 72 flow. Second operand 5 states and 62 transitions. [2022-12-05 23:00:16,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 57 transitions, 270 flow [2022-12-05 23:00:16,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 57 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:00:16,431 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 114 flow [2022-12-05 23:00:16,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-05 23:00:16,432 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 23:00:16,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:16,432 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 114 flow [2022-12-05 23:00:16,433 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:16,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:16,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 114 flow [2022-12-05 23:00:16,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 114 flow [2022-12-05 23:00:16,443 INFO L130 PetriNetUnfolder]: 43/140 cut-off events. [2022-12-05 23:00:16,443 INFO L131 PetriNetUnfolder]: For 45/50 co-relation queries the response was YES. [2022-12-05 23:00:16,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 140 events. 43/140 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 656 event pairs, 22 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 314. Up to 51 conditions per place. [2022-12-05 23:00:16,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 114 flow [2022-12-05 23:00:16,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-05 23:00:16,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L846-3-->L850: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= v_~main$tmp_guard0~0_32 (ite (= (ite (= v_~__unbuffered_cnt~0_105 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [417] L824-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-05 23:00:16,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:00:16,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 23:00:16,483 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 112 flow [2022-12-05 23:00:16,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:16,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:16,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:16,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:00:16,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1767288595, now seen corresponding path program 1 times [2022-12-05 23:00:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:16,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128581667] [2022-12-05 23:00:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128581667] [2022-12-05 23:00:16,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128581667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:16,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:16,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:00:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241047158] [2022-12-05 23:00:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:16,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:00:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:00:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:00:16,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:00:16,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 112 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:16,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:16,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:00:16,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:16,738 INFO L130 PetriNetUnfolder]: 485/802 cut-off events. [2022-12-05 23:00:16,739 INFO L131 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2022-12-05 23:00:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 802 events. 485/802 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3201 event pairs, 103 based on Foata normal form. 8/810 useless extension candidates. Maximal degree in co-relation 2357. Up to 624 conditions per place. [2022-12-05 23:00:16,743 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 34 selfloop transitions, 3 changer transitions 1/38 dead transitions. [2022-12-05 23:00:16,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 234 flow [2022-12-05 23:00:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:00:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:00:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:00:16,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-05 23:00:16,745 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 112 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:00:16,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 234 flow [2022-12-05 23:00:16,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 232 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 23:00:16,747 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 113 flow [2022-12-05 23:00:16,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-05 23:00:16,748 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-05 23:00:16,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:16,748 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 113 flow [2022-12-05 23:00:16,750 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:16,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:16,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 113 flow [2022-12-05 23:00:16,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 113 flow [2022-12-05 23:00:16,759 INFO L130 PetriNetUnfolder]: 34/110 cut-off events. [2022-12-05 23:00:16,759 INFO L131 PetriNetUnfolder]: For 53/59 co-relation queries the response was YES. [2022-12-05 23:00:16,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 110 events. 34/110 cut-off events. For 53/59 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 468 event pairs, 16 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 271. Up to 46 conditions per place. [2022-12-05 23:00:16,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 113 flow [2022-12-05 23:00:16,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-05 23:00:16,761 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:00:16,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:00:16,766 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 113 flow [2022-12-05 23:00:16,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:16,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:16,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:00:16,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:16,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -969124848, now seen corresponding path program 1 times [2022-12-05 23:00:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:16,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860408145] [2022-12-05 23:00:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860408145] [2022-12-05 23:00:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860408145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:00:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447601067] [2022-12-05 23:00:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:00:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:00:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:00:16,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:00:16,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:16,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:16,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:00:16,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:17,034 INFO L130 PetriNetUnfolder]: 253/464 cut-off events. [2022-12-05 23:00:17,035 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-12-05 23:00:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 464 events. 253/464 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1916 event pairs, 55 based on Foata normal form. 44/500 useless extension candidates. Maximal degree in co-relation 1380. Up to 132 conditions per place. [2022-12-05 23:00:17,038 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 39 selfloop transitions, 8 changer transitions 16/66 dead transitions. [2022-12-05 23:00:17,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 385 flow [2022-12-05 23:00:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:00:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:00:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-05 23:00:17,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:00:17,039 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 113 flow. Second operand 6 states and 75 transitions. [2022-12-05 23:00:17,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 385 flow [2022-12-05 23:00:17,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 369 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:00:17,043 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 167 flow [2022-12-05 23:00:17,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-05 23:00:17,044 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-05 23:00:17,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:17,044 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 167 flow [2022-12-05 23:00:17,045 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:17,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:17,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 167 flow [2022-12-05 23:00:17,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 167 flow [2022-12-05 23:00:17,054 INFO L130 PetriNetUnfolder]: 21/84 cut-off events. [2022-12-05 23:00:17,054 INFO L131 PetriNetUnfolder]: For 115/129 co-relation queries the response was YES. [2022-12-05 23:00:17,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 84 events. 21/84 cut-off events. For 115/129 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 283 event pairs, 4 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 262. Up to 35 conditions per place. [2022-12-05 23:00:17,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 167 flow [2022-12-05 23:00:17,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-05 23:00:17,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:00:17,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-05 23:00:17,090 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 159 flow [2022-12-05 23:00:17,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:17,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:17,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:17,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:00:17,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1463085786, now seen corresponding path program 1 times [2022-12-05 23:00:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:17,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488685706] [2022-12-05 23:00:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488685706] [2022-12-05 23:00:17,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488685706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:17,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:00:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162951316] [2022-12-05 23:00:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:17,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:00:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:17,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:00:17,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:00:17,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:00:17,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:17,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:17,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:00:17,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:17,333 INFO L130 PetriNetUnfolder]: 269/511 cut-off events. [2022-12-05 23:00:17,333 INFO L131 PetriNetUnfolder]: For 678/680 co-relation queries the response was YES. [2022-12-05 23:00:17,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 511 events. 269/511 cut-off events. For 678/680 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2229 event pairs, 40 based on Foata normal form. 10/516 useless extension candidates. Maximal degree in co-relation 1740. Up to 301 conditions per place. [2022-12-05 23:00:17,336 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 49 selfloop transitions, 2 changer transitions 8/61 dead transitions. [2022-12-05 23:00:17,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 460 flow [2022-12-05 23:00:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:00:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:00:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 23:00:17,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-05 23:00:17,338 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 159 flow. Second operand 4 states and 47 transitions. [2022-12-05 23:00:17,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 460 flow [2022-12-05 23:00:17,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 410 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-05 23:00:17,343 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 152 flow [2022-12-05 23:00:17,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-05 23:00:17,345 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-05 23:00:17,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:17,345 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 152 flow [2022-12-05 23:00:17,346 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:17,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:17,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 152 flow [2022-12-05 23:00:17,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 152 flow [2022-12-05 23:00:17,356 INFO L130 PetriNetUnfolder]: 33/119 cut-off events. [2022-12-05 23:00:17,356 INFO L131 PetriNetUnfolder]: For 136/143 co-relation queries the response was YES. [2022-12-05 23:00:17,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 119 events. 33/119 cut-off events. For 136/143 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 488 event pairs, 6 based on Foata normal form. 7/124 useless extension candidates. Maximal degree in co-relation 341. Up to 50 conditions per place. [2022-12-05 23:00:17,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 152 flow [2022-12-05 23:00:17,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:00:17,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:00:17,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-05 23:00:17,516 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 155 flow [2022-12-05 23:00:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:17,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:17,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:00:17,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1753989064, now seen corresponding path program 2 times [2022-12-05 23:00:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741884991] [2022-12-05 23:00:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:17,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:17,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741884991] [2022-12-05 23:00:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741884991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:17,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:00:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767520745] [2022-12-05 23:00:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:17,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:00:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:00:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:00:17,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:00:17,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:17,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:17,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:00:17,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:17,763 INFO L130 PetriNetUnfolder]: 222/427 cut-off events. [2022-12-05 23:00:17,763 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2022-12-05 23:00:17,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 427 events. 222/427 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1799 event pairs, 63 based on Foata normal form. 20/441 useless extension candidates. Maximal degree in co-relation 1371. Up to 157 conditions per place. [2022-12-05 23:00:17,765 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 29 selfloop transitions, 11 changer transitions 15/58 dead transitions. [2022-12-05 23:00:17,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 375 flow [2022-12-05 23:00:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:00:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:00:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-05 23:00:17,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-05 23:00:17,766 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 155 flow. Second operand 7 states and 69 transitions. [2022-12-05 23:00:17,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 375 flow [2022-12-05 23:00:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 338 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-05 23:00:17,768 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 164 flow [2022-12-05 23:00:17,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2022-12-05 23:00:17,768 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-05 23:00:17,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:17,768 INFO L89 Accepts]: Start accepts. Operand has 48 places, 29 transitions, 164 flow [2022-12-05 23:00:17,769 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:17,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:17,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 29 transitions, 164 flow [2022-12-05 23:00:17,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 29 transitions, 164 flow [2022-12-05 23:00:17,774 INFO L130 PetriNetUnfolder]: 12/59 cut-off events. [2022-12-05 23:00:17,774 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-05 23:00:17,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 59 events. 12/59 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 182. Up to 23 conditions per place. [2022-12-05 23:00:17,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 29 transitions, 164 flow [2022-12-05 23:00:17,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-05 23:00:18,360 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:00:18,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 593 [2022-12-05 23:00:18,361 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2022-12-05 23:00:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:18,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:18,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:18,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:00:18,362 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1194080840, now seen corresponding path program 1 times [2022-12-05 23:00:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:18,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990576258] [2022-12-05 23:00:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:18,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990576258] [2022-12-05 23:00:18,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990576258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:18,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:18,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:00:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447208795] [2022-12-05 23:00:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:18,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:00:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:00:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:00:18,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:00:18,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:18,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:18,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:00:18,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:18,865 INFO L130 PetriNetUnfolder]: 126/255 cut-off events. [2022-12-05 23:00:18,865 INFO L131 PetriNetUnfolder]: For 455/455 co-relation queries the response was YES. [2022-12-05 23:00:18,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 255 events. 126/255 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 974 event pairs, 11 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 958. Up to 150 conditions per place. [2022-12-05 23:00:18,867 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 33 selfloop transitions, 12 changer transitions 24/69 dead transitions. [2022-12-05 23:00:18,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 515 flow [2022-12-05 23:00:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 23:00:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 23:00:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-12-05 23:00:18,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-05 23:00:18,869 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 9 states and 54 transitions. [2022-12-05 23:00:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 515 flow [2022-12-05 23:00:18,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 434 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-05 23:00:18,872 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 180 flow [2022-12-05 23:00:18,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-05 23:00:18,873 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-05 23:00:18,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:18,873 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 180 flow [2022-12-05 23:00:18,874 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:18,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:18,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 180 flow [2022-12-05 23:00:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 180 flow [2022-12-05 23:00:18,882 INFO L130 PetriNetUnfolder]: 27/87 cut-off events. [2022-12-05 23:00:18,882 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-05 23:00:18,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 87 events. 27/87 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 295 event pairs, 1 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 245. Up to 23 conditions per place. [2022-12-05 23:00:18,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 180 flow [2022-12-05 23:00:18,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-05 23:00:18,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] $Ultimate##0-->L788: Formula: (and (= v_~x$w_buff0_used~0_143 1) (= v_~x$r_buff1_thd2~0_31 v_~x$r_buff0_thd2~0_43) (= v_~x$w_buff0~0_78 1) (= v_~x$r_buff0_thd2~0_42 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd3~0_31 v_~x$r_buff0_thd3~0_33) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0~0_79 v_~x$w_buff1~0_56) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_143 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_129 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0_used~0_144 v_~x$w_buff1_used~0_129) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_59) (= v_~x$r_buff1_thd0~0_31 v_~x$r_buff0_thd0~0_39)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_79, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_39, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_43, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_78, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_31, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_31, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_31, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [451] $Ultimate##0-->L814: Formula: (and (= v_~y~0_29 1) (= v_~z~0_38 1) (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|) (= v_~z~0_38 v_~__unbuffered_p2_EAX~0_64)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z~0=v_~z~0_38, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] [2022-12-05 23:00:19,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] $Ultimate##0-->L814: Formula: (and (= v_~y~0_29 1) (= v_~z~0_38 1) (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|) (= v_~z~0_38 v_~__unbuffered_p2_EAX~0_64)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z~0=v_~z~0_38, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [462] $Ultimate##0-->L791: Formula: (and (= v_~x$r_buff0_thd3~0_125 v_~x$r_buff1_thd3~0_124) (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (= v_~x$w_buff0_used~0_401 v_~x$w_buff1_used~0_368) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff1_thd2~0_101) (= v_~x$r_buff0_thd2~0_134 1) (= v_~x$w_buff0_used~0_400 1) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_78) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$w_buff0~0_248 1) (= v_~x$w_buff0~0_249 v_~x$w_buff1~0_208) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_368 256) 0)) (not (= (mod v_~x$w_buff0_used~0_400 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff0_thd1~0_155 v_~x$r_buff1_thd1~0_163) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| 0)) (= v_~x$r_buff0_thd0~0_144 v_~x$r_buff1_thd0~0_142)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_249, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_144, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_125, ~y~0=v_~y~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_401} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_248, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_144, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_208, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_124, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_368, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_163, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_125, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_400, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] [2022-12-05 23:00:19,699 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:00:19,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 827 [2022-12-05 23:00:19,700 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 192 flow [2022-12-05 23:00:19,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:19,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:19,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:19,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:00:19,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1786389399, now seen corresponding path program 1 times [2022-12-05 23:00:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:19,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252786357] [2022-12-05 23:00:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:20,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252786357] [2022-12-05 23:00:20,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252786357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:20,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:20,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:00:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507175292] [2022-12-05 23:00:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:20,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:00:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:00:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:00:20,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:00:20,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 192 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:20,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:20,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:00:20,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:20,325 INFO L130 PetriNetUnfolder]: 120/249 cut-off events. [2022-12-05 23:00:20,326 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-12-05 23:00:20,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 249 events. 120/249 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1035 event pairs, 10 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 935. Up to 125 conditions per place. [2022-12-05 23:00:20,328 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 42 selfloop transitions, 13 changer transitions 23/78 dead transitions. [2022-12-05 23:00:20,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 583 flow [2022-12-05 23:00:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:00:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:00:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-12-05 23:00:20,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2022-12-05 23:00:20,340 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 192 flow. Second operand 8 states and 56 transitions. [2022-12-05 23:00:20,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 583 flow [2022-12-05 23:00:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 563 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:00:20,344 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 253 flow [2022-12-05 23:00:20,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-12-05 23:00:20,345 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-05 23:00:20,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:20,345 INFO L89 Accepts]: Start accepts. Operand has 50 places, 36 transitions, 253 flow [2022-12-05 23:00:20,348 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:20,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:20,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 253 flow [2022-12-05 23:00:20,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 253 flow [2022-12-05 23:00:20,361 INFO L130 PetriNetUnfolder]: 30/104 cut-off events. [2022-12-05 23:00:20,361 INFO L131 PetriNetUnfolder]: For 164/173 co-relation queries the response was YES. [2022-12-05 23:00:20,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 104 events. 30/104 cut-off events. For 164/173 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 1 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 347. Up to 29 conditions per place. [2022-12-05 23:00:20,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 253 flow [2022-12-05 23:00:20,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-05 23:00:20,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L791: Formula: (and (= v_~x$r_buff0_thd0~0_148 v_~x$r_buff1_thd0~0_146) (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_82) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_46 1) (= v_~x$r_buff0_thd2~0_142 1) (= v_~x$w_buff0_used~0_413 v_~x$w_buff1_used~0_376) (= |v_P1Thread1of1ForFork0_~arg#1.base_41| |v_P1Thread1of1ForFork0_#in~arg#1.base_41|) (= v_~x$w_buff0~0_258 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_412 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_376 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$w_buff0~0_259 v_~x$w_buff1~0_214) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_41| |v_P1Thread1of1ForFork0_~arg#1.offset_41|) (= v_~y~0_47 1) (= v_~x$r_buff0_thd3~0_133 v_~x$r_buff1_thd3~0_132) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~x$r_buff0_thd1~0_159 v_~x$r_buff1_thd1~0_167) (= v_~x$r_buff0_thd2~0_143 v_~x$r_buff1_thd2~0_105) (= v_~x$w_buff0_used~0_412 1) (= v_~z~0_46 v_~__unbuffered_p2_EAX~0_83) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_259, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_413} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_41|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~y~0=v_~y~0_47, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_41|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~x$w_buff1~0=v_~x$w_buff1~0_214, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_376, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_146, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_412, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [340] L814-->L817: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-05 23:00:20,492 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L791: Formula: (and (= v_~x$r_buff0_thd0~0_148 v_~x$r_buff1_thd0~0_146) (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_82) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_46 1) (= v_~x$r_buff0_thd2~0_142 1) (= v_~x$w_buff0_used~0_413 v_~x$w_buff1_used~0_376) (= |v_P1Thread1of1ForFork0_~arg#1.base_41| |v_P1Thread1of1ForFork0_#in~arg#1.base_41|) (= v_~x$w_buff0~0_258 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_412 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_376 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$w_buff0~0_259 v_~x$w_buff1~0_214) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_41| |v_P1Thread1of1ForFork0_~arg#1.offset_41|) (= v_~y~0_47 1) (= v_~x$r_buff0_thd3~0_133 v_~x$r_buff1_thd3~0_132) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~x$r_buff0_thd1~0_159 v_~x$r_buff1_thd1~0_167) (= v_~x$r_buff0_thd2~0_143 v_~x$r_buff1_thd2~0_105) (= v_~x$w_buff0_used~0_412 1) (= v_~z~0_46 v_~__unbuffered_p2_EAX~0_83) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_259, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_413} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_41|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~y~0=v_~y~0_47, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_41|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~x$w_buff1~0=v_~x$w_buff1~0_214, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_376, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_146, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_412, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [459] L814-->L824: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_388 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_114 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_113 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_357 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_389 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_242 (ite .cse1 v_~x$w_buff1~0_202 v_~x~0_296)) v_~x~0_295) (= v_~__unbuffered_p2_EBX~0_79 v_~a~0_41) (= (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_113 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_356 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_113) v_~x$r_buff1_thd3~0_112) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_357) v_~x$w_buff1_used~0_356) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_114) v_~x$r_buff0_thd3~0_113) (= (ite .cse0 0 v_~x$w_buff0_used~0_389) v_~x$w_buff0_used~0_388)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_242, ~a~0=v_~a~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_357, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_114, ~x~0=v_~x~0_296, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_389} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~a~0=v_~a~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_356, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x~0=v_~x~0_295, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_388} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:00:20,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L846-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_366 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_135 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_137 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_367 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_339 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~main$tmp_guard0~0_58 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (mod v_~main$tmp_guard0~0_58 256)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_338 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd0~0_136 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_135) v_~x$r_buff1_thd0~0_134) (= (ite .cse2 0 v_~x$w_buff0_used~0_367) v_~x$w_buff0_used~0_366) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= (ite .cse2 v_~x$w_buff0~0_226 (ite .cse3 v_~x$w_buff1~0_190 v_~x~0_282)) v_~x~0_281) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_339) v_~x$w_buff1_used~0_338) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_77 1) (= v_~__unbuffered_p0_EAX~0_108 0) (= v_~__unbuffered_p2_EBX~0_77 0) (= v_~__unbuffered_p1_EAX~0_74 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65| 0) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_137) v_~x$r_buff0_thd0~0_136)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_226, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_137, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_339, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_367, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_282} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_226, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_77, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_33|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_47|, ~x$w_buff1~0=v_~x$w_buff1~0_190, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_338, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_58, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_134, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_366, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_281, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [463] $Ultimate##0-->L791: Formula: (and (= v_~x$r_buff0_thd2~0_139 v_~x$r_buff1_thd2~0_103) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_39| |v_P1Thread1of1ForFork0_~arg#1.offset_39|) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_126) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd0~0_146 v_~x$r_buff1_thd0~0_144) (= v_~x$w_buff0~0_253 v_~x$w_buff1~0_210) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_80) (= |v_P1Thread1of1ForFork0_~arg#1.base_39| |v_P1Thread1of1ForFork0_#in~arg#1.base_39|) (= v_~x$w_buff0~0_252 1) (= v_~x$r_buff0_thd1~0_157 v_~x$r_buff1_thd1~0_165) (= v_~x$r_buff0_thd2~0_138 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= v_~x$w_buff0_used~0_405 v_~x$w_buff1_used~0_370) (= v_~x$w_buff0_used~0_404 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_370 256) 0)) (not (= (mod v_~x$w_buff0_used~0_404 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_253, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_146, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~y~0=v_~y~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_405} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_252, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_146, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_157, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_210, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_126, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_370, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_144, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_404, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] [2022-12-05 23:00:21,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L767: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_156 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_148 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse6 .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_371 256) 0)) (.cse2 (and .cse10 (= (mod v_~x$w_buff1_used~0_343 256) 0)))) (let ((.cse7 (or .cse1 .cse12 .cse2)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse5 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_370 256) 0)) (.cse9 (ite .cse7 v_~x~0_286 (ite .cse8 v_~x$w_buff0~0_229 v_~x$w_buff1~0_193)))) (and (= v_~x$w_buff0~0_228 v_~x$w_buff0~0_229) (= v_~x$w_buff1~0_193 v_~x$w_buff1~0_192) (= v_~x$flush_delayed~0_75 0) (= v_~a~0_39 1) (= v_~x$w_buff1_used~0_342 (ite .cse0 v_~x$w_buff1_used~0_343 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_343 0))) (= (ite .cse0 v_~x$r_buff1_thd1~0_156 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_147 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse3)) v_~x$r_buff1_thd1~0_156 0)) v_~x$r_buff1_thd1~0_155) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x$mem_tmp~0_70 v_~x~0_286) (= v_~weak$$choice0~0_63 |v_P0Thread1of1ForFork2_#t~nondet3_78|) (= v_~weak$$choice2~0_92 |v_P0Thread1of1ForFork2_#t~nondet4_78|) (= v_~x$w_buff0_used~0_370 (ite .cse0 v_~x$w_buff0_used~0_371 (ite .cse7 v_~x$w_buff0_used~0_371 (ite .cse8 0 v_~x$w_buff0_used~0_371)))) (= (ite .cse0 v_~x$mem_tmp~0_70 .cse9) v_~x~0_285) (= v_~x$r_buff0_thd1~0_147 (ite .cse0 v_~x$r_buff0_thd1~0_148 (ite (or .cse1 (and .cse5 .cse10) .cse3) v_~x$r_buff0_thd1~0_148 (ite (and .cse11 (not .cse3)) 0 v_~x$r_buff0_thd1~0_148)))) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= .cse9 v_~__unbuffered_p0_EAX~0_110)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_229, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_148, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_193, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_156, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_78|, ~x~0=v_~x~0_286, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_78|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_371} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_228, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_147, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_155, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_370, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17, ~weak$$choice0~0=v_~weak$$choice0~0_63, ~a~0=v_~a~0_39, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_285} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base, ~weak$$choice0~0, ~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] and [463] $Ultimate##0-->L791: Formula: (and (= v_~x$r_buff0_thd2~0_139 v_~x$r_buff1_thd2~0_103) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_39| |v_P1Thread1of1ForFork0_~arg#1.offset_39|) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_126) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd0~0_146 v_~x$r_buff1_thd0~0_144) (= v_~x$w_buff0~0_253 v_~x$w_buff1~0_210) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_80) (= |v_P1Thread1of1ForFork0_~arg#1.base_39| |v_P1Thread1of1ForFork0_#in~arg#1.base_39|) (= v_~x$w_buff0~0_252 1) (= v_~x$r_buff0_thd1~0_157 v_~x$r_buff1_thd1~0_165) (= v_~x$r_buff0_thd2~0_138 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= v_~x$w_buff0_used~0_405 v_~x$w_buff1_used~0_370) (= v_~x$w_buff0_used~0_404 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_370 256) 0)) (not (= (mod v_~x$w_buff0_used~0_404 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_253, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_146, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~y~0=v_~y~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_405} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_252, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_146, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_157, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_210, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_126, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_370, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_144, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_404, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] [2022-12-05 23:00:21,298 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:00:21,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 954 [2022-12-05 23:00:21,299 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 284 flow [2022-12-05 23:00:21,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:21,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:21,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:21,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:00:21,299 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 20973341, now seen corresponding path program 1 times [2022-12-05 23:00:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:21,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383266246] [2022-12-05 23:00:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:00:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:00:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:00:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383266246] [2022-12-05 23:00:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383266246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:00:21,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:00:21,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:00:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677798183] [2022-12-05 23:00:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:00:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:00:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:00:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:00:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:00:21,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:00:21,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 284 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:21,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:00:21,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:00:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:00:21,540 INFO L130 PetriNetUnfolder]: 137/306 cut-off events. [2022-12-05 23:00:21,540 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-05 23:00:21,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 306 events. 137/306 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1446 event pairs, 34 based on Foata normal form. 3/307 useless extension candidates. Maximal degree in co-relation 1252. Up to 141 conditions per place. [2022-12-05 23:00:21,542 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 23 selfloop transitions, 3 changer transitions 32/58 dead transitions. [2022-12-05 23:00:21,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 513 flow [2022-12-05 23:00:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:00:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:00:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-05 23:00:21,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.312 [2022-12-05 23:00:21,543 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 284 flow. Second operand 5 states and 39 transitions. [2022-12-05 23:00:21,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 513 flow [2022-12-05 23:00:21,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 475 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-05 23:00:21,547 INFO L231 Difference]: Finished difference. Result has 49 places, 24 transitions, 143 flow [2022-12-05 23:00:21,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=49, PETRI_TRANSITIONS=24} [2022-12-05 23:00:21,548 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-05 23:00:21,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:00:21,548 INFO L89 Accepts]: Start accepts. Operand has 49 places, 24 transitions, 143 flow [2022-12-05 23:00:21,549 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:00:21,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:00:21,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 24 transitions, 143 flow [2022-12-05 23:00:21,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 24 transitions, 143 flow [2022-12-05 23:00:21,555 INFO L130 PetriNetUnfolder]: 13/54 cut-off events. [2022-12-05 23:00:21,555 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 23:00:21,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 54 events. 13/54 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 1 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 164. Up to 19 conditions per place. [2022-12-05 23:00:21,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 24 transitions, 143 flow [2022-12-05 23:00:21,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-05 23:00:21,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->L791: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0~0_239 v_~x$w_buff1~0_200) (= v_~x$w_buff0~0_238 1) (= v_~x$r_buff1_thd2~0_99 v_~x$r_buff0_thd2~0_131) (= v_~y~0_39 v_~__unbuffered_p1_EAX~0_76) (= v_~x$r_buff0_thd3~0_111 v_~x$r_buff1_thd3~0_110) (= v_~x$w_buff0_used~0_385 v_~x$w_buff1_used~0_354) (= v_~x$w_buff0_used~0_384 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_384 256) 0)) (not (= (mod v_~x$w_buff1_used~0_354 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd0~0_142 v_~x$r_buff1_thd0~0_140) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= v_~x$r_buff0_thd2~0_130 1) (= v_~x$r_buff0_thd1~0_153 v_~x$r_buff1_thd1~0_161) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_239, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_153, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~y~0=v_~y~0_39, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_131, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_385} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_238, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_153, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_110, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_99, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_354, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_161, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_130, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_384, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] and [470] $Ultimate##0-->L824: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_438 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_146 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_439 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_397 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= v_~x$r_buff0_thd3~0_145 (ite .cse0 0 v_~x$r_buff0_thd3~0_146)) (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~y~0_57 1) (= (ite .cse1 v_~x$w_buff0~0_280 (ite .cse2 v_~x$w_buff1~0_230 v_~x~0_324)) v_~x~0_323) (= (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_396 256))) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_145 256) 0)))) 0 v_~x$r_buff1_thd3~0_145) v_~x$r_buff1_thd3~0_144) (= v_~z~0_52 v_~__unbuffered_p2_EAX~0_91) (= (ite .cse1 0 v_~x$w_buff0_used~0_439) v_~x$w_buff0_used~0_438) (= v_~__unbuffered_p2_EBX~0_93 v_~a~0_55) (= v_~z~0_52 1) (= (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_397) v_~x$w_buff1_used~0_396) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_280, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~a~0=v_~a~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_230, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_145, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_397, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_146, ~x~0=v_~x~0_324, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_439} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_280, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_93, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, ~x$w_buff1~0=v_~x$w_buff1~0_230, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_396, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, ~a~0=v_~a~0_55, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_91, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_52, ~y~0=v_~y~0_57, ~x~0=v_~x~0_323} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:00:21,967 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:00:21,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-05 23:00:21,968 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 149 flow [2022-12-05 23:00:21,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:00:21,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:00:21,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:21,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:00:21,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:00:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:00:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1420696186, now seen corresponding path program 1 times [2022-12-05 23:00:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:00:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942779254] [2022-12-05 23:00:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:00:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:00:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:00:21,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:00:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:00:22,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:00:22,020 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:00:22,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:00:22,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:00:22,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:00:22,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:00:22,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:00:22,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:00:22,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:00:22,022 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:00:22,026 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:00:22,026 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:00:22,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:00:22 BasicIcfg [2022-12-05 23:00:22,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:00:22,061 INFO L158 Benchmark]: Toolchain (without parser) took 12155.13ms. Allocated memory was 191.9MB in the beginning and 368.1MB in the end (delta: 176.2MB). Free memory was 165.7MB in the beginning and 201.8MB in the end (delta: -36.1MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,061 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory was 168.3MB in the beginning and 168.2MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:00:22,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.48ms. Allocated memory is still 191.9MB. Free memory was 165.7MB in the beginning and 139.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 191.9MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,062 INFO L158 Benchmark]: Boogie Preprocessor took 19.98ms. Allocated memory is still 191.9MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,062 INFO L158 Benchmark]: RCFGBuilder took 537.03ms. Allocated memory is still 191.9MB. Free memory was 134.7MB in the beginning and 102.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,062 INFO L158 Benchmark]: TraceAbstraction took 11238.66ms. Allocated memory was 191.9MB in the beginning and 368.1MB in the end (delta: 176.2MB). Free memory was 101.7MB in the beginning and 201.8MB in the end (delta: -100.1MB). Peak memory consumption was 76.1MB. Max. memory is 8.0GB. [2022-12-05 23:00:22,063 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.09ms. Allocated memory is still 191.9MB. Free memory was 168.3MB in the beginning and 168.2MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.48ms. Allocated memory is still 191.9MB. Free memory was 165.7MB in the beginning and 139.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 191.9MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.98ms. Allocated memory is still 191.9MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.03ms. Allocated memory is still 191.9MB. Free memory was 134.7MB in the beginning and 102.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11238.66ms. Allocated memory was 191.9MB in the beginning and 368.1MB in the end (delta: 176.2MB). Free memory was 101.7MB in the beginning and 201.8MB in the end (delta: -100.1MB). Peak memory consumption was 76.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 117 PlacesBefore, 36 PlacesAfterwards, 109 TransitionsBefore, 27 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1528, independent: 1470, independent conditional: 1470, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1528, independent: 1470, independent conditional: 0, independent unconditional: 1470, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1528, independent: 1470, independent conditional: 0, independent unconditional: 1470, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1528, independent: 1470, independent conditional: 0, independent unconditional: 1470, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1247, independent: 1207, independent conditional: 0, independent unconditional: 1207, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1247, independent: 1196, independent conditional: 0, independent unconditional: 1196, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1528, independent: 263, independent conditional: 0, independent unconditional: 263, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1247, unknown conditional: 0, unknown unconditional: 1247] , Statistics on independence cache: Total cache size (in pairs): 1858, Positive cache size: 1818, Positive conditional cache size: 0, Positive unconditional cache size: 1818, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 147, independent conditional: 10, independent unconditional: 137, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 147, independent conditional: 10, independent unconditional: 137, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 147, independent conditional: 10, independent unconditional: 137, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, independent: 77, independent conditional: 6, independent unconditional: 71, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 98, dependent conditional: 18, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 70, independent conditional: 4, independent unconditional: 66, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 96, unknown conditional: 8, unknown unconditional: 88] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 78, Positive conditional cache size: 6, Positive unconditional cache size: 72, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 58, independent conditional: 5, independent unconditional: 53, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 73, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 91, Positive conditional cache size: 6, Positive unconditional cache size: 85, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 117, independent conditional: 35, independent unconditional: 82, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 117, independent conditional: 27, independent unconditional: 90, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 117, independent conditional: 27, independent unconditional: 90, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 5, independent unconditional: 4, 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: 11, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 108, independent conditional: 22, independent unconditional: 86, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 103, Positive conditional cache size: 11, Positive unconditional cache size: 92, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 42, independent conditional: 11, independent unconditional: 31, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 42, independent conditional: 7, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 42, independent conditional: 7, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 53, independent: 42, independent conditional: 7, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 103, Positive conditional cache size: 11, Positive unconditional cache size: 92, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 96, independent conditional: 34, independent unconditional: 62, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 122, independent: 93, independent conditional: 23, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 106, Positive conditional cache size: 14, Positive unconditional cache size: 92, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 56, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 108, independent conditional: 54, independent unconditional: 54, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 54, independent unconditional: 54, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 128, independent: 106, independent conditional: 54, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 14, Positive unconditional cache size: 103, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, 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.6s, 46 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 37, independent unconditional: 23, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 60, independent conditional: 35, independent unconditional: 25, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 35, independent unconditional: 25, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 55, independent conditional: 32, independent unconditional: 23, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 137, Positive conditional cache size: 17, Positive unconditional cache size: 120, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, 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.8s, 43 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 24, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 31, independent conditional: 16, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 16, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 26, independent conditional: 13, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 180, Positive conditional cache size: 23, Positive unconditional cache size: 157, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, 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.9s, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 37 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 183, Positive conditional cache size: 25, Positive unconditional cache size: 158, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, 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.4s, 45 PlacesBefore, 44 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 21, independent conditional: 21, 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: 30, independent: 21, independent conditional: 19, independent unconditional: 2, 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: 30, independent: 21, independent conditional: 17, independent unconditional: 4, 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: 30, independent: 21, independent conditional: 17, independent unconditional: 4, 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: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 30, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 188, Positive conditional cache size: 27, Positive unconditional cache size: 161, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-2, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-1, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 [L790] 2 __unbuffered_p1_EAX = y [L807] 2 y = 1 [L810] 2 z = 1 [L813] 2 __unbuffered_p2_EAX = z [L816] 2 __unbuffered_p2_EBX = a [L819] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L750] 1 a = 1 [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 844]: 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: 842]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 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: 11.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 16 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=9, InterpolantAutomatonStates: 53, 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.9s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:00:22,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...