/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:40:46,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:40:46,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:40:46,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:40:46,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:40:46,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:40:46,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:40:46,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:40:46,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:40:46,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:40:46,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:40:46,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:40:46,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:40:46,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:40:46,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:40:46,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:40:46,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:40:46,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:40:46,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:40:46,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:40:46,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:40:46,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:40:46,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:40:46,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:40:46,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:40:46,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:40:46,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:40:46,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:40:46,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:40:46,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:40:46,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:40:46,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:40:46,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:40:46,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:40:46,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:40:46,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:40:46,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:40:46,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:40:46,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:40:46,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:40:46,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:40:46,153 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:40:46,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:40:46,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:40:46,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:40:46,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:40:46,195 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:40:46,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:40:46,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:40:46,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:40:46,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:40:46,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:40:46,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:40:46,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:40:46,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:40:46,198 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:40:46,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:40:46,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:40:46,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:40:46,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:40:46,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:40:46,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:40:46,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:40:46,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:40:46,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:40:46,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:40:46,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:40:46,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:40:46,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:40:46,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:40:46,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:40:46,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:40:46,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:40:46,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:40:46,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:40:46,611 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:40:46,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2022-12-06 06:40:48,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:40:48,554 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:40:48,555 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2022-12-06 06:40:48,570 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbf2a88d/942d9a5b059b4f38bf971bbf53dbc72d/FLAGd00c97b65 [2022-12-06 06:40:48,586 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbf2a88d/942d9a5b059b4f38bf971bbf53dbc72d [2022-12-06 06:40:48,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:40:48,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:40:48,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:40:48,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:40:48,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:40:48,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:40:48" (1/1) ... [2022-12-06 06:40:48,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca224b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:48, skipping insertion in model container [2022-12-06 06:40:48,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:40:48" (1/1) ... [2022-12-06 06:40:48,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:40:48,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:40:48,800 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i[994,1007] [2022-12-06 06:40:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:40:49,063 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:40:49,076 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i[994,1007] [2022-12-06 06:40:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:40:49,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:40:49,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:40:49,196 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:40:49,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49 WrapperNode [2022-12-06 06:40:49,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:40:49,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:40:49,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:40:49,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:40:49,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,244 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-12-06 06:40:49,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:40:49,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:40:49,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:40:49,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:40:49,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,276 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:40:49,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:40:49,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:40:49,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:40:49,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (1/1) ... [2022-12-06 06:40:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:40:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:40:49,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:40:49,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:40:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:40:49,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:40:49,347 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:40:49,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:40:49,347 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:40:49,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:40:49,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:40:49,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:40:49,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:40:49,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:40:49,348 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:40:49,543 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:40:49,545 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:40:49,979 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:40:50,274 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:40:50,275 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:40:50,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:40:50 BoogieIcfgContainer [2022-12-06 06:40:50,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:40:50,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:40:50,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:40:50,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:40:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:40:48" (1/3) ... [2022-12-06 06:40:50,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab67eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:40:50, skipping insertion in model container [2022-12-06 06:40:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:40:49" (2/3) ... [2022-12-06 06:40:50,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab67eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:40:50, skipping insertion in model container [2022-12-06 06:40:50,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:40:50" (3/3) ... [2022-12-06 06:40:50,287 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2022-12-06 06:40:50,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:40:50,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:40:50,300 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:40:50,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:40:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 06:40:50,538 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 06:40:50,538 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:50,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 06:40:50,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 06:40:50,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-06 06:40:50,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:50,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 06:40:50,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-06 06:40:50,632 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 06:40:50,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:50,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 06:40:50,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 06:40:50,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-06 06:41:01,364 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 06:41:01,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:41:01,384 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;@26297f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:41:01,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:41:01,408 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:41:01,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:01,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:01,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:41:01,409 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-06 06:41:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 814399064, now seen corresponding path program 1 times [2022-12-06 06:41:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:01,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870300608] [2022-12-06 06:41:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:01,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870300608] [2022-12-06 06:41:01,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870300608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:01,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:01,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084696511] [2022-12-06 06:41:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:01,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:41:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:41:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:41:01,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:41:01,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:01,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:01,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:41:01,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:02,279 INFO L130 PetriNetUnfolder]: 879/1324 cut-off events. [2022-12-06 06:41:02,279 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:41:02,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1324 events. 879/1324 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5666 event pairs, 240 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 2680. Up to 1060 conditions per place. [2022-12-06 06:41:02,292 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2022-12-06 06:41:02,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 154 flow [2022-12-06 06:41:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:41:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:41:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:41:02,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:41:02,304 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:41:02,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 154 flow [2022-12-06 06:41:02,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:41:02,308 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 48 flow [2022-12-06 06:41:02,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 06:41:02,314 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:41:02,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:02,315 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 48 flow [2022-12-06 06:41:02,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:02,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:02,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 48 flow [2022-12-06 06:41:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 48 flow [2022-12-06 06:41:02,325 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:41:02,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:41:02,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 48 flow [2022-12-06 06:41:02,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 06:41:02,525 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:02,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 06:41:02,528 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 06:41:02,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:02,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:02,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:02,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:41:02,528 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-06 06:41:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859040, now seen corresponding path program 1 times [2022-12-06 06:41:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:02,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296080910] [2022-12-06 06:41:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296080910] [2022-12-06 06:41:02,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296080910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:02,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:02,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684232045] [2022-12-06 06:41:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:02,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:41:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:41:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:41:02,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:41:02,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:02,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:02,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:41:02,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:03,057 INFO L130 PetriNetUnfolder]: 527/811 cut-off events. [2022-12-06 06:41:03,058 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 06:41:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 811 events. 527/811 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3492 event pairs, 95 based on Foata normal form. 16/823 useless extension candidates. Maximal degree in co-relation 1723. Up to 687 conditions per place. [2022-12-06 06:41:03,064 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 06:41:03,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2022-12-06 06:41:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:41:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:41:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:41:03,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 06:41:03,065 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:41:03,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2022-12-06 06:41:03,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:03,067 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 06:41:03,068 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 06:41:03,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:03,068 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:03,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:03,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,077 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:41:03,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:03,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:03,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:41:03,088 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:03,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:41:03,091 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 06:41:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:03,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:03,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:03,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:41:03,092 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-06 06:41:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash 707990517, now seen corresponding path program 1 times [2022-12-06 06:41:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:03,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566699521] [2022-12-06 06:41:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566699521] [2022-12-06 06:41:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566699521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:41:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507865628] [2022-12-06 06:41:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:03,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:41:03,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:03,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:03,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:41:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:03,590 INFO L130 PetriNetUnfolder]: 791/1216 cut-off events. [2022-12-06 06:41:03,590 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 06:41:03,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 1216 events. 791/1216 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4906 event pairs, 239 based on Foata normal form. 60/1276 useless extension candidates. Maximal degree in co-relation 2644. Up to 445 conditions per place. [2022-12-06 06:41:03,595 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2022-12-06 06:41:03,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 161 flow [2022-12-06 06:41:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:41:03,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:41:03,597 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:41:03,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 161 flow [2022-12-06 06:41:03,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:03,598 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 62 flow [2022-12-06 06:41:03,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 06:41:03,599 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 06:41:03,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:03,600 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 06:41:03,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:03,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:03,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 06:41:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 06:41:03,607 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:41:03,607 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:41:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 19 events. 0/19 cut-off events. For 2/2 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/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:03,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 06:41:03,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 06:41:04,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] $Ultimate##0-->L835: Formula: (let ((.cse25 (mod v_~x$w_buff0_used~0_487 256)) (.cse26 (mod v_~weak$$choice0~0_152 256)) (.cse2 (= (mod v_~x$w_buff0_used~0_486 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd3~0_214 256) 0))) (let ((.cse17 (not .cse5)) (.cse6 (not .cse2)) (.cse24 (= (mod v_~weak$$choice2~0_144 256) 0)) (.cse0 (select |v_#memory_int_527| |v_~#x~0.base_277|)) (.cse20 (= .cse26 0)) (.cse21 (= (mod v_~x$w_buff1_used~0_461 256) 0)) (.cse10 (= .cse25 0))) (let ((.cse16 (not .cse10)) (.cse4 (not .cse21)) (.cse19 (= (mod v_~weak$$choice1~0_140 256) 0)) (.cse18 (not .cse20)) (.cse12 (select .cse0 |v_~#x~0.offset_277|)) (.cse1 (not .cse24)) (.cse3 (and .cse17 .cse6)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_214 256) 0)) (.cse23 (not (= (mod v_~x$w_buff1_used~0_460 256) 0)))) (and (= (store |v_#memory_int_527| |v_~#x~0.base_277| (store .cse0 |v_~#x~0.offset_277| |v_P2_#t~ite29_44|)) |v_#memory_int_526|) (= v_~x$w_buff1~0_287 v_~x$w_buff1~0_286) (= v_~x$w_buff1_used~0_460 (ite .cse1 v_~x$w_buff1_used~0_461 (ite .cse2 v_~x$w_buff1_used~0_461 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~weak$$choice0~0_152 0))))) (let ((.cse9 (= |v_P2_#t~ite24_64| |v_P2Thread1of1ForFork1_#t~ite24_30|)) (.cse8 (= |v_P2_#t~ite23_72| |v_P2Thread1of1ForFork1_#t~ite23_30|)) (.cse13 (= |v_P2Thread1of1ForFork1_#t~mem19_30| |v_P2_#t~mem19_75|)) (.cse14 (= |v_P2_#t~ite20_72| |v_P2Thread1of1ForFork1_#t~ite20_30|)) (.cse11 (= |v_P2Thread1of1ForFork1_#t~mem21_30| |v_P2_#t~mem21_81|)) (.cse15 (= |v_P2_#t~ite22_78| |v_P2Thread1of1ForFork1_#t~ite22_30|))) (or (and (= |v_P2_#t~ite25_54| |v_P2Thread1of1ForFork1_#t~ite25_30|) .cse8 .cse9 .cse10 .cse11 (= |v_P2_#t~mem18_47| .cse12) .cse13 .cse14 (= |v_P2_#t~mem18_47| v_~__unbuffered_p2_EAX~0_138) .cse15) (and .cse16 (= |v_P2_#t~ite25_54| v_~__unbuffered_p2_EAX~0_138) (= |v_P2Thread1of1ForFork1_#t~mem18_30| |v_P2_#t~mem18_47|) (or (and .cse8 .cse17 .cse9 .cse11 .cse13 .cse14 (= |v_P2_#t~ite25_54| v_~x$w_buff0~0_305) .cse15) (and (= |v_P2_#t~ite24_64| |v_P2_#t~ite25_54|) .cse5 (or (and .cse8 (= |v_P2_#t~ite20_72| |v_P2_#t~ite24_64|) .cse11 .cse4 .cse7 (or (and (= |v_P2_#t~ite20_72| |v_P2_#t~mem19_75|) (= |v_P2_#t~mem19_75| .cse12) .cse18) (and (= |v_P2_#t~ite20_72| (ite (not .cse19) v_~x$w_buff0~0_305 v_~x$w_buff1~0_287)) .cse13 .cse20)) .cse15) (and .cse13 .cse14 (or .cse21 (not .cse7)) (or (and .cse21 (or (and .cse20 (= |v_P2_#t~ite22_78| |v_P2_#t~mem21_81|) (= |v_P2_#t~mem21_81| .cse12)) (and .cse11 (= |v_P2_#t~ite22_78| v_~x$w_buff0~0_305) .cse18)) (= |v_P2_#t~ite22_78| |v_P2_#t~ite23_72|)) (and .cse11 .cse4 (= |v_P2_#t~ite23_72| (ite .cse18 v_~x$w_buff1~0_287 v_~x$w_buff0~0_305)) .cse15)) (= |v_P2_#t~ite24_64| |v_P2_#t~ite23_72|)))))))) (= |v_~#x~0.offset_277| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_91) (= v_~weak$$choice1~0_140 |v_P2Thread1of1ForFork1_#t~nondet17_30|) (= (ite .cse1 v_~x$r_buff1_thd3~0_214 (ite .cse2 v_~x$r_buff1_thd3~0_214 (let ((.cse22 (= (mod v_~x$r_buff0_thd3~0_213 256) 0))) (ite (and (not .cse22) .cse6) 0 (ite (and .cse22 .cse6 .cse7 .cse23) (ite .cse18 v_~x$r_buff1_thd3~0_214 0) 0))))) v_~x$r_buff1_thd3~0_213) (= v_~weak$$choice2~0_144 |v_P2Thread1of1ForFork1_#t~nondet15_30|) (= v_~y~0_44 1) (or (and (= |v_P2_#t~ite29_44| |v_P2_#t~mem28_45|) .cse24 (= |v_P2_#t~mem28_45| v_~__unbuffered_p2_EAX~0_138)) (and (= |v_P2Thread1of1ForFork1_#t~mem28_30| |v_P2_#t~mem28_45|) .cse1 (= |v_P2_#t~ite29_44| v_~x$mem_tmp~0_104))) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= (ite (= (ite .cse1 .cse25 (ite .cse10 .cse25 (ite (and .cse16 .cse17) 0 (ite (and .cse16 .cse4 .cse5 .cse7) (ite (or .cse19 .cse18) 1 0) .cse26)))) 0) 0 1) v_~x$w_buff0_used~0_486) (= v_~__unbuffered_p2_EAX$read_delayed~0_86 1) (= v_~x$flush_delayed~0_132 0) (= .cse12 v_~x$mem_tmp~0_104) (= |v_P2Thread1of1ForFork1_#t~nondet14_30| v_~weak$$choice0~0_152) (= (ite .cse1 v_~x$r_buff0_thd3~0_214 (ite .cse2 v_~x$r_buff0_thd3~0_214 (ite .cse3 0 (ite (and .cse5 .cse6 .cse7 .cse23) v_~x$r_buff0_thd3~0_214 0)))) v_~x$r_buff0_thd3~0_213) (= |v_~#x~0.base_277| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_91) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_30|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_30|, ~#x~0.offset=|v_~#x~0.offset_277|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_30|, ~x$w_buff1~0=v_~x$w_buff1~0_287, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_214, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_461, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_214, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_487, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_30|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_30|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_30|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_30|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_30|, #memory_int=|v_#memory_int_527|, ~#x~0.base=|v_~#x~0.base_277|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_30|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$flush_delayed~0=v_~x$flush_delayed~0_132, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_91, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_17|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_91, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_213, ~weak$$choice1~0=v_~weak$$choice1~0_140, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_17|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_138, ~y~0=v_~y~0_44, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_17|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, ~#x~0.offset=|v_~#x~0.offset_277|, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_17|, ~x$w_buff1~0=v_~x$w_buff1~0_286, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_460, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~weak$$choice0~0=v_~weak$$choice0~0_152, #memory_int=|v_#memory_int_526|, ~#x~0.base=|v_~#x~0.base_277|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_144} AuxVars[|v_P2_#t~ite20_72|, |v_P2_#t~ite29_44|, |v_P2_#t~mem21_81|, |v_P2_#t~ite23_72|, |v_P2_#t~ite24_64|, |v_P2_#t~ite25_54|, |v_P2_#t~mem28_45|, |v_P2_#t~ite22_78|, |v_P2_#t~mem18_47|, |v_P2_#t~mem19_75|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, P2Thread1of1ForFork1_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0] and [803] $Ultimate##0-->L762: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_22 v_~__unbuffered_p0_EAX~0_38)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_22, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:41:06,172 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:41:06,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2574 [2022-12-06 06:41:06,173 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 58 flow [2022-12-06 06:41:06,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:06,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:06,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:06,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:41:06,174 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-06 06:41:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 708770694, now seen corresponding path program 1 times [2022-12-06 06:41:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:06,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241932178] [2022-12-06 06:41:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:07,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241932178] [2022-12-06 06:41:07,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241932178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:07,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733968473] [2022-12-06 06:41:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:07,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:07,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:07,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:41:07,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 58 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:07,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:07,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:41:07,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:07,624 INFO L130 PetriNetUnfolder]: 321/506 cut-off events. [2022-12-06 06:41:07,624 INFO L131 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-12-06 06:41:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 506 events. 321/506 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1798 event pairs, 156 based on Foata normal form. 18/524 useless extension candidates. Maximal degree in co-relation 1159. Up to 388 conditions per place. [2022-12-06 06:41:07,628 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 28 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2022-12-06 06:41:07,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 178 flow [2022-12-06 06:41:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:41:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:41:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 06:41:07,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4470588235294118 [2022-12-06 06:41:07,631 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 58 flow. Second operand 5 states and 38 transitions. [2022-12-06 06:41:07,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 178 flow [2022-12-06 06:41:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 158 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 06:41:07,635 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 98 flow [2022-12-06 06:41:07,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-06 06:41:07,637 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 06:41:07,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:07,637 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 98 flow [2022-12-06 06:41:07,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:07,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:07,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 98 flow [2022-12-06 06:41:07,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 98 flow [2022-12-06 06:41:07,671 INFO L130 PetriNetUnfolder]: 61/132 cut-off events. [2022-12-06 06:41:07,671 INFO L131 PetriNetUnfolder]: For 33/34 co-relation queries the response was YES. [2022-12-06 06:41:07,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 132 events. 61/132 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 482 event pairs, 35 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 292. Up to 94 conditions per place. [2022-12-06 06:41:07,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 98 flow [2022-12-06 06:41:07,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 06:41:07,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [731] $Ultimate##0-->L799: Formula: (and (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_265 256) 0)) (not (= (mod v_~x$w_buff1_used~0_245 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd1~0_64 v_~x$r_buff0_thd1~0_65) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0~0_144 1) (= v_~x$r_buff0_thd3~0_115 v_~x$r_buff1_thd3~0_113) (= v_~x$w_buff0~0_145 v_~x$w_buff1~0_137) (= v_~x$w_buff0_used~0_265 1) (= v_~x$r_buff1_thd0~0_56 v_~x$r_buff0_thd0~0_54) (= v_~x$r_buff0_thd2~0_67 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd2~0_54 v_~x$r_buff0_thd2~0_68) (= v_~x$w_buff0_used~0_266 v_~x$w_buff1_used~0_245)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_266} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_144, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, 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_137, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_64, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_56, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_265, 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 [689] L762-->L778: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_204 256) 0)) (.cse11 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd1~0_53 256) 0)) (.cse15 (= (mod v_~x$r_buff0_thd1~0_56 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_64 256) 0)) (.cse0 (select |v_#memory_int_203| |v_~#x~0.base_136|)) (.cse6 (and .cse9 .cse15)) (.cse8 (and .cse15 .cse11)) (.cse10 (not .cse15)) (.cse12 (not .cse16))) (let ((.cse5 (and .cse10 .cse12)) (.cse4 (or .cse6 .cse16 .cse8)) (.cse3 (select .cse0 |v_~#x~0.offset_136|)) (.cse1 (not .cse2)) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_187 256))) (.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (store |v_#memory_int_203| |v_~#x~0.base_136| (store .cse0 |v_~#x~0.offset_136| |v_P0_#t~ite10_33|)) |v_#memory_int_202|) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_1| |v_P0_#t~mem9_32|) .cse1 (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_30)) (and (= v_~__unbuffered_p0_EBX~0_14 |v_P0_#t~mem9_32|) .cse2 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|))) (= .cse3 v_~x$mem_tmp~0_30) (= v_~x$w_buff0_used~0_203 (ite .cse1 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_58) (= v_~x$w_buff1~0_88 v_~x$w_buff1~0_87) (= v_~x$flush_delayed~0_50 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~x$w_buff0~0_93 v_~x$w_buff0~0_92) (= (ite .cse1 v_~x$w_buff1_used~0_188 (ite (or .cse6 .cse7 .cse8) v_~x$w_buff1_used~0_188 0)) v_~x$w_buff1_used~0_187) (or (and (or (not .cse9) .cse10) (= |v_P0Thread1of1ForFork2_#t~mem6_1| |v_P0_#t~mem6_34|) (or (not .cse11) .cse10) .cse12 (= v_~__unbuffered_p0_EBX~0_14 (ite .cse5 v_~x$w_buff0~0_93 v_~x$w_buff1~0_88))) (and .cse4 (= v_~__unbuffered_p0_EBX~0_14 |v_P0_#t~mem6_34|) (= .cse3 |v_P0_#t~mem6_34|))) (= (ite .cse1 v_~x$r_buff1_thd1~0_53 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_55 256) 0))) (or (and .cse13 .cse14) (and .cse9 .cse13) .cse7)) v_~x$r_buff1_thd1~0_53 0)) v_~x$r_buff1_thd1~0_52) (= v_~x$r_buff0_thd1~0_55 (ite .cse1 v_~x$r_buff0_thd1~0_56 (ite (or .cse6 (and .cse15 .cse14) .cse7) v_~x$r_buff0_thd1~0_56 (ite (and .cse10 (not .cse7)) 0 v_~x$r_buff0_thd1~0_56)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~#x~0.offset=|v_~#x~0.offset_136|, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_53, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_1|, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, #memory_int=|v_#memory_int_203|, ~#x~0.base=|v_~#x~0.base_136|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_92, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_50, ~#x~0.offset=|v_~#x~0.offset_136|, ~x$w_buff1~0=v_~x$w_buff1~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_58, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_1|, #memory_int=|v_#memory_int_202|, ~#x~0.base=|v_~#x~0.base_136|, ~weak$$choice2~0=v_~weak$$choice2~0_64, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_1|} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork2_#t~ite10] [2022-12-06 06:41:08,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [731] $Ultimate##0-->L799: Formula: (and (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_265 256) 0)) (not (= (mod v_~x$w_buff1_used~0_245 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd1~0_64 v_~x$r_buff0_thd1~0_65) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0~0_144 1) (= v_~x$r_buff0_thd3~0_115 v_~x$r_buff1_thd3~0_113) (= v_~x$w_buff0~0_145 v_~x$w_buff1~0_137) (= v_~x$w_buff0_used~0_265 1) (= v_~x$r_buff1_thd0~0_56 v_~x$r_buff0_thd0~0_54) (= v_~x$r_buff0_thd2~0_67 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd2~0_54 v_~x$r_buff0_thd2~0_68) (= v_~x$w_buff0_used~0_266 v_~x$w_buff1_used~0_245)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_266} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_144, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, 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_137, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_64, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_56, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_265, 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 [703] L835-->L842: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (not .cse7)) (.cse8 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= 0 (mod v_~x$r_buff1_thd3~0_74 256))) (.cse9 (= (mod v_~x$w_buff1_used~0_204 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (select |v_#memory_int_219| |v_~#x~0.base_148|)) (.cse1 (not .cse10)) (.cse4 (not .cse8)) (.cse0 (and .cse11 .cse6))) (and (= v_~x$w_buff1_used~0_203 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_204)) (= |v_#memory_int_218| (store |v_#memory_int_219| |v_~#x~0.base_148| (store .cse3 |v_~#x~0.offset_148| |v_P2_#t~ite32_27|))) (let ((.cse5 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_98) .cse4 .cse5 (= |v_P2_#t~ite31_27| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse6) (and (= |v_P2_#t~ite31_27| |v_P2_#t~ite32_27|) (or .cse7 .cse8) (or (and .cse5 (= |v_P2_#t~ite31_27| v_~x$w_buff1~0_101) .cse1 .cse2) (and (= |v_P2_#t~ite31_27| |v_P2_#t~mem30_30|) (= (select .cse3 |v_~#x~0.offset_148|) |v_P2_#t~mem30_30|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd3~0_73 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 0 v_~x$r_buff1_thd3~0_74)) (= (ite (and .cse4 .cse6) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_78) v_~x$r_buff0_thd3~0_77))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~#x~0.offset=|v_~#x~0.offset_148|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_219|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_148|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_P2_#t~ite31_27|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 06:41:09,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [731] $Ultimate##0-->L799: Formula: (and (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_265 256) 0)) (not (= (mod v_~x$w_buff1_used~0_245 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd1~0_64 v_~x$r_buff0_thd1~0_65) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0~0_144 1) (= v_~x$r_buff0_thd3~0_115 v_~x$r_buff1_thd3~0_113) (= v_~x$w_buff0~0_145 v_~x$w_buff1~0_137) (= v_~x$w_buff0_used~0_265 1) (= v_~x$r_buff1_thd0~0_56 v_~x$r_buff0_thd0~0_54) (= v_~x$r_buff0_thd2~0_67 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd2~0_54 v_~x$r_buff0_thd2~0_68) (= v_~x$w_buff0_used~0_266 v_~x$w_buff1_used~0_245)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_266} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_144, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, 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_137, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_64, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_56, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_265, 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 [798] L3-->L875: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_73 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff1_used~0_313 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_79 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_330 256) 0)) (.cse4 (not .cse10)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_329 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse3 (not .cse11)) (.cse6 (select |v_#memory_int_347| |v_~#x~0.base_212|)) (.cse1 (not .cse9)) (.cse2 (not .cse8))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13| 0)) (= v_~x$w_buff1_used~0_312 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_313)) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_73) v_~x$r_buff0_thd0~0_72) (= (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_330) v_~x$w_buff0_used~0_329) (= v_~x$r_buff1_thd0~0_78 (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd0~0_72 256))) .cse5) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_312 256) 0)))) 0 v_~x$r_buff1_thd0~0_79)) (= (store |v_#memory_int_347| |v_~#x~0.base_212| (store .cse6 |v_~#x~0.offset_212| |v_ULTIMATE.start_main_#t~ite41#1_54|)) |v_#memory_int_346|) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem39#1_66| |v_ULTIMATE.start_main_#t~mem39#1_64|))) (or (and .cse3 .cse7 (= |v_ULTIMATE.start_main_#t~ite41#1_54| v_~x$w_buff0~0_192) (= |v_ULTIMATE.start_main_#t~ite40#1_67| |v_ULTIMATE.start_main_#t~ite40#1_65|) .cse4) (and (= |v_ULTIMATE.start_main_#t~ite40#1_65| |v_ULTIMATE.start_main_#t~ite41#1_54|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_64| (select .cse6 |v_~#x~0.offset_212|)) (= |v_ULTIMATE.start_main_#t~ite40#1_65| |v_ULTIMATE.start_main_#t~mem39#1_64|) (or .cse8 .cse9)) (and .cse7 .cse1 (= |v_ULTIMATE.start_main_#t~ite40#1_65| v_~x$w_buff1~0_184) .cse2)) (or .cse10 .cse11)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_192, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_73, ~#x~0.offset=|v_~#x~0.offset_212|, ~x$w_buff1~0=v_~x$w_buff1~0_184, #memory_int=|v_#memory_int_347|, ~#x~0.base=|v_~#x~0.base_212|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_313, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_79, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_66|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_330, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_192, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_72, ~#x~0.offset=|v_~#x~0.offset_212|, ~x$w_buff1~0=v_~x$w_buff1~0_184, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_312, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_329, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_53|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_346|, ~#x~0.base=|v_~#x~0.base_212|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_54|, |v_ULTIMATE.start_main_#t~ite40#1_65|, |v_ULTIMATE.start_main_#t~mem39#1_64|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ~x$w_buff0_used~0] [2022-12-06 06:41:09,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:09,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2208 [2022-12-06 06:41:09,845 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 106 flow [2022-12-06 06:41:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:09,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:09,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:09,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:41:09,845 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-06 06:41:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 472801725, now seen corresponding path program 1 times [2022-12-06 06:41:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:09,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270460786] [2022-12-06 06:41:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270460786] [2022-12-06 06:41:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270460786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:10,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:10,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205785215] [2022-12-06 06:41:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:10,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:41:10,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:10,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:41:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:10,340 INFO L130 PetriNetUnfolder]: 237/397 cut-off events. [2022-12-06 06:41:10,341 INFO L131 PetriNetUnfolder]: For 365/365 co-relation queries the response was YES. [2022-12-06 06:41:10,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 397 events. 237/397 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1446 event pairs, 36 based on Foata normal form. 49/446 useless extension candidates. Maximal degree in co-relation 1209. Up to 252 conditions per place. [2022-12-06 06:41:10,343 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 30 selfloop transitions, 4 changer transitions 23/57 dead transitions. [2022-12-06 06:41:10,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 388 flow [2022-12-06 06:41:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:41:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:41:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 06:41:10,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2022-12-06 06:41:10,348 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 106 flow. Second operand 5 states and 59 transitions. [2022-12-06 06:41:10,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 388 flow [2022-12-06 06:41:10,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:41:10,358 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 140 flow [2022-12-06 06:41:10,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 06:41:10,360 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 06:41:10,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:10,361 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 140 flow [2022-12-06 06:41:10,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:10,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:10,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 140 flow [2022-12-06 06:41:10,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 140 flow [2022-12-06 06:41:10,398 INFO L130 PetriNetUnfolder]: 97/195 cut-off events. [2022-12-06 06:41:10,398 INFO L131 PetriNetUnfolder]: For 205/207 co-relation queries the response was YES. [2022-12-06 06:41:10,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 195 events. 97/195 cut-off events. For 205/207 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 770 event pairs, 39 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 573. Up to 113 conditions per place. [2022-12-06 06:41:10,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 140 flow [2022-12-06 06:41:10,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 06:41:10,402 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:10,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:41:10,405 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 140 flow [2022-12-06 06:41:10,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:10,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:10,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:41:10,405 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-06 06:41:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1743797130, now seen corresponding path program 1 times [2022-12-06 06:41:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927772606] [2022-12-06 06:41:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927772606] [2022-12-06 06:41:10,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927772606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:10,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:10,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527695136] [2022-12-06 06:41:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:10,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:41:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:41:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:41:10,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:41:10,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:10,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:41:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:10,914 INFO L130 PetriNetUnfolder]: 110/209 cut-off events. [2022-12-06 06:41:10,914 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-06 06:41:10,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 209 events. 110/209 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 665 event pairs, 11 based on Foata normal form. 30/239 useless extension candidates. Maximal degree in co-relation 760. Up to 103 conditions per place. [2022-12-06 06:41:10,916 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 34 selfloop transitions, 7 changer transitions 18/59 dead transitions. [2022-12-06 06:41:10,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 438 flow [2022-12-06 06:41:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:41:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:41:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 06:41:10,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-06 06:41:10,919 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 140 flow. Second operand 6 states and 62 transitions. [2022-12-06 06:41:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 438 flow [2022-12-06 06:41:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 423 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:41:10,923 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 187 flow [2022-12-06 06:41:10,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 06:41:10,926 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 06:41:10,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:10,926 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 187 flow [2022-12-06 06:41:10,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:10,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:10,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 187 flow [2022-12-06 06:41:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 187 flow [2022-12-06 06:41:10,947 INFO L130 PetriNetUnfolder]: 37/97 cut-off events. [2022-12-06 06:41:10,948 INFO L131 PetriNetUnfolder]: For 146/147 co-relation queries the response was YES. [2022-12-06 06:41:10,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 97 events. 37/97 cut-off events. For 146/147 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 307 event pairs, 9 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 323. Up to 50 conditions per place. [2022-12-06 06:41:10,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 187 flow [2022-12-06 06:41:10,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:41:10,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] L864-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_57) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [834] $Ultimate##0-->L875: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_131 256) 0))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_542 256) 0))) (.cse0 (not .cse3))) (let ((.cse5 (and .cse1 .cse0)) (.cse2 (select |v_#memory_int_575| |v_~#x~0.base_297|)) (.cse4 (= 0 (mod v_~x$w_buff0_used~0_544 256)))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= v_~x$w_buff0~0_348 1) (= v_~x$r_buff0_thd2~0_161 1) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_509 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_130 256) 0)))) 0 v_~x$r_buff0_thd0~0_131) v_~x$r_buff1_thd0~0_135) (= v_~x$w_buff0~0_349 v_~x$w_buff1~0_323) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_118| |v_ULTIMATE.start_main_#t~mem39#1_116|) (= |v_ULTIMATE.start_main_#t~ite41#1_98| v_~x$w_buff0~0_348) (= |v_ULTIMATE.start_main_#t~ite40#1_119| |v_ULTIMATE.start_main_#t~ite40#1_117|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem39#1_116| (select .cse2 |v_~#x~0.offset_297|)) (= |v_ULTIMATE.start_main_#t~mem39#1_116| |v_ULTIMATE.start_main_#t~ite40#1_117|) .cse3 (= |v_ULTIMATE.start_main_#t~ite41#1_98| |v_ULTIMATE.start_main_#t~ite40#1_117|))) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_34| |v_P1Thread1of1ForFork0_#in~arg#1.base_34|) (= v_~x$r_buff0_thd2~0_162 v_~x$r_buff1_thd2~0_127) (= v_~x$r_buff0_thd1~0_188 v_~x$r_buff1_thd1~0_189) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff1_used~0_509 (ite (or (and (not .cse4) .cse0) .cse5) 0 v_~x$w_buff0_used~0_544)) (= v_~x$r_buff0_thd0~0_130 (ite .cse5 0 v_~x$r_buff0_thd0~0_131)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_34| |v_P1Thread1of1ForFork0_~arg#1.offset_34|) (= |v_#memory_int_574| (store |v_#memory_int_575| |v_~#x~0.base_297| (store .cse2 |v_~#x~0.offset_297| |v_ULTIMATE.start_main_#t~ite41#1_98|))) (= v_~x$r_buff0_thd3~0_239 v_~x$r_buff1_thd3~0_239) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff0_used~0_542 (ite .cse0 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_349, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_131, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, ~#x~0.offset=|v_~#x~0.offset_297|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_239, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_544, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, #memory_int=|v_#memory_int_575|, ~#x~0.base=|v_~#x~0.base_297|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_118|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_119|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_348, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_34|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_239, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_189, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_239, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_97|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_34|, ~#x~0.offset=|v_~#x~0.offset_297|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_509, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_135, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, #memory_int=|v_#memory_int_574|, ~#x~0.base=|v_~#x~0.base_297|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_98|, |v_ULTIMATE.start_main_#t~mem39#1_116|, |v_ULTIMATE.start_main_#t~ite40#1_117|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1] [2022-12-06 06:41:11,270 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:11,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 06:41:11,272 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 191 flow [2022-12-06 06:41:11,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:11,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:11,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:41:11,272 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-06 06:41:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -795632154, now seen corresponding path program 1 times [2022-12-06 06:41:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:11,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714302305] [2022-12-06 06:41:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:11,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:11,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714302305] [2022-12-06 06:41:11,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714302305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:11,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:11,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749895807] [2022-12-06 06:41:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:11,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:11,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:41:11,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) 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-06 06:41:11,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:11,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:41:11,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:11,806 INFO L130 PetriNetUnfolder]: 61/123 cut-off events. [2022-12-06 06:41:11,806 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-12-06 06:41:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 123 events. 61/123 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 331 event pairs, 8 based on Foata normal form. 9/132 useless extension candidates. Maximal degree in co-relation 481. Up to 58 conditions per place. [2022-12-06 06:41:11,808 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 30 selfloop transitions, 10 changer transitions 8/48 dead transitions. [2022-12-06 06:41:11,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 386 flow [2022-12-06 06:41:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:41:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:41:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-06 06:41:11,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2022-12-06 06:41:11,809 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 191 flow. Second operand 7 states and 50 transitions. [2022-12-06 06:41:11,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 386 flow [2022-12-06 06:41:11,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 337 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 06:41:11,812 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 167 flow [2022-12-06 06:41:11,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:41:11,813 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:41:11,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:11,813 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 167 flow [2022-12-06 06:41:11,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:11,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:11,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 167 flow [2022-12-06 06:41:11,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 167 flow [2022-12-06 06:41:11,828 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 06:41:11,829 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 06:41:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 64 events. 23/64 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 4 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 181. Up to 28 conditions per place. [2022-12-06 06:41:11,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 167 flow [2022-12-06 06:41:11,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 06:41:12,900 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:41:12,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1088 [2022-12-06 06:41:12,901 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 163 flow [2022-12-06 06:41:12,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) 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-06 06:41:12,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:12,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:41:12,902 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-06 06:41:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 138512117, now seen corresponding path program 1 times [2022-12-06 06:41:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482158522] [2022-12-06 06:41:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:41:13,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:41:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:41:13,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:41:13,182 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:41:13,182 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:41:13,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:41:13,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:41:13,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:41:13,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:41:13,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:41:13,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:41:13,185 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:13,190 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:41:13,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:41:13,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:41:13 BasicIcfg [2022-12-06 06:41:13,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:41:13,305 INFO L158 Benchmark]: Toolchain (without parser) took 24715.18ms. Allocated memory was 241.2MB in the beginning and 465.6MB in the end (delta: 224.4MB). Free memory was 215.7MB in the beginning and 199.2MB in the end (delta: 16.5MB). Peak memory consumption was 242.4MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,305 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 241.2MB. Free memory is still 217.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:41:13,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.72ms. Allocated memory is still 241.2MB. Free memory was 215.2MB in the beginning and 186.8MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.31ms. Allocated memory is still 241.2MB. Free memory was 186.8MB in the beginning and 184.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,306 INFO L158 Benchmark]: Boogie Preprocessor took 32.35ms. Allocated memory is still 241.2MB. Free memory was 184.3MB in the beginning and 181.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,306 INFO L158 Benchmark]: RCFGBuilder took 993.99ms. Allocated memory is still 241.2MB. Free memory was 181.6MB in the beginning and 100.9MB in the end (delta: 80.7MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,306 INFO L158 Benchmark]: TraceAbstraction took 23024.88ms. Allocated memory was 241.2MB in the beginning and 465.6MB in the end (delta: 224.4MB). Free memory was 100.4MB in the beginning and 199.2MB in the end (delta: -98.9MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:13,308 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 241.2MB. Free memory is still 217.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 605.72ms. Allocated memory is still 241.2MB. Free memory was 215.2MB in the beginning and 186.8MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.31ms. Allocated memory is still 241.2MB. Free memory was 186.8MB in the beginning and 184.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.35ms. Allocated memory is still 241.2MB. Free memory was 184.3MB in the beginning and 181.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 993.99ms. Allocated memory is still 241.2MB. Free memory was 181.6MB in the beginning and 100.9MB in the end (delta: 80.7MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. * TraceAbstraction took 23024.88ms. Allocated memory was 241.2MB in the beginning and 465.6MB in the end (delta: 224.4MB). Free memory was 100.4MB in the beginning and 199.2MB in the end (delta: -98.9MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7s, 130 PlacesBefore, 34 PlacesAfterwards, 122 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1208, independent: 1160, independent conditional: 1160, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1208, independent: 1160, independent conditional: 0, independent unconditional: 1160, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1208, independent: 1160, independent conditional: 0, independent unconditional: 1160, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1208, independent: 1160, independent conditional: 0, independent unconditional: 1160, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1019, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1019, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 354, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1208, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1019, unknown conditional: 0, unknown unconditional: 1019] , Statistics on independence cache: Total cache size (in pairs): 1504, Positive cache size: 1472, Positive conditional cache size: 0, Positive unconditional cache size: 1472, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 3, independent unconditional: 31, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 34, independent conditional: 3, independent unconditional: 31, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 3, independent unconditional: 31, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 33, independent conditional: 3, independent unconditional: 30, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 194, dependent conditional: 11, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 48, unknown conditional: 4, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 33, Positive conditional cache size: 3, Positive unconditional cache size: 30, Negative cache size: 15, Negative conditional cache size: 1, Negative unconditional cache size: 14, 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, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 35, Positive conditional cache size: 3, Positive unconditional cache size: 32, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 32 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 50, Positive conditional cache size: 3, Positive unconditional cache size: 47, Negative cache size: 22, Negative conditional cache size: 1, 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: 2.2s, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 32, independent conditional: 32, 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: 41, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 41, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 41, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 8, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 25, independent conditional: 17, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 66, Positive conditional cache size: 8, Positive unconditional cache size: 58, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 66, Positive conditional cache size: 8, Positive unconditional cache size: 58, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 70, Positive conditional cache size: 9, Positive unconditional cache size: 61, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 40 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 73, Positive conditional cache size: 9, Positive unconditional cache size: 64, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2204, ((void *)0), P0, ((void *)0))=-2, t2204={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L861] 0 pthread_t t2205; [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2205, ((void *)0), P1, ((void *)0))=-1, t2204={7:0}, t2205={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L863] 0 pthread_t t2206; [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2206, ((void *)0), P2, ((void *)0))=0, t2204={7:0}, t2205={8:0}, t2206={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 [L834] 3 y = 1 [L761] 3 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3: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=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 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 [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3: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=1] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] EXPR 2 !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) [L768] EXPR 2 \read(x) [L768] EXPR 2 !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) [L768] 2 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) [L769] 2 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)) [L770] 2 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)) [L771] 2 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)) [L772] 2 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)) [L773] 2 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)) [L774] 2 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)) [L775] EXPR 2 \read(x) [L775] 2 __unbuffered_p0_EBX = x [L776] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L776] 2 x = x$flush_delayed ? x$mem_tmp : x [L777] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3: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] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=1, weak$$choice2=255, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 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) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 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 [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 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 [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L881] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3: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=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 862]: 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: 864]: 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: 860]: 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, 150 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: 22.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=6, InterpolantAutomatonStates: 33, 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.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:41:13,343 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...