/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:28:13,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:28:13,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:28:13,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:28:13,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:28:13,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:28:13,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:28:13,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:28:13,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:28:13,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:28:13,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:28:13,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:28:13,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:28:13,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:28:13,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:28:13,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:28:13,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:28:13,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:28:13,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:28:13,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:28:13,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:28:13,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:28:13,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:28:13,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:28:13,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:28:13,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:28:13,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:28:13,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:28:13,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:28:13,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:28:13,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:28:13,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:28:13,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:28:13,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:28:13,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:28:13,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:28:13,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:28:13,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:28:13,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:28:13,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:28:13,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:28:13,240 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-SemanticLbe.epf [2022-12-12 14:28:13,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:28:13,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:28:13,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:28:13,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:28:13,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:28:13,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:28:13,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:28:13,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:28:13,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:28:13,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:28:13,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:28:13,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:28:13,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:28:13,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:28:13,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:28:13,265 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-12 14:28:13,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:28:13,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:28:13,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:28:13,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:28:13,572 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:28:13,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-12-12 14:28:14,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:28:14,885 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:28:14,885 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-12-12 14:28:14,893 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7e52565/58d26ea4043142cf8fc89a35826ba7c8/FLAGe23db056d [2022-12-12 14:28:14,903 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7e52565/58d26ea4043142cf8fc89a35826ba7c8 [2022-12-12 14:28:14,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:28:14,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:28:14,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:28:14,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:28:14,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:28:14,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:28:14" (1/1) ... [2022-12-12 14:28:14,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcf62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:14, skipping insertion in model container [2022-12-12 14:28:14,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:28:14" (1/1) ... [2022-12-12 14:28:14,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:28:14,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:28:15,079 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/mix012_pso.opt_tso.opt.i[999,1012] [2022-12-12 14:28:15,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:28:15,260 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:28:15,268 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/mix012_pso.opt_tso.opt.i[999,1012] [2022-12-12 14:28:15,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:28:15,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:28:15,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:28:15,348 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:28:15,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15 WrapperNode [2022-12-12 14:28:15,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:28:15,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:28:15,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:28:15,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:28:15,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,388 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-12 14:28:15,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:28:15,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:28:15,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:28:15,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:28:15,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:28:15,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:28:15,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:28:15,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:28:15,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (1/1) ... [2022-12-12 14:28:15,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:28:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:28:15,434 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-12 14:28:15,436 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-12 14:28:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:28:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:28:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:28:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:28:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:28:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:28:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:28:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:28:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:28:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:28:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:28:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:28:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:28:15,467 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:28:15,614 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:28:15,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:28:15,882 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:28:15,993 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:28:15,994 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:28:15,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:28:15 BoogieIcfgContainer [2022-12-12 14:28:15,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:28:15,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:28:15,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:28:15,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:28:15,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:28:14" (1/3) ... [2022-12-12 14:28:16,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db1bbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:28:15, skipping insertion in model container [2022-12-12 14:28:16,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:28:15" (2/3) ... [2022-12-12 14:28:16,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db1bbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:28:16, skipping insertion in model container [2022-12-12 14:28:16,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:28:15" (3/3) ... [2022-12-12 14:28:16,001 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2022-12-12 14:28:16,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:28:16,019 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:28:16,019 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:28:16,060 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:28:16,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-12 14:28:16,131 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-12 14:28:16,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:28:16,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 14:28:16,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-12 14:28:16,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-12 14:28:16,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:28:16,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-12 14:28:16,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-12 14:28:16,175 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-12 14:28:16,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:28:16,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 14:28:16,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-12 14:28:16,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-12 14:28:19,684 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-12 14:28:19,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:28:19,709 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=PETRI_NET, 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;@519c13ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:28:19,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 14:28:19,712 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-12 14:28:19,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:28:19,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:19,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:28:19,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 423568939, now seen corresponding path program 1 times [2022-12-12 14:28:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:19,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862201127] [2022-12-12 14:28:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:20,050 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-12 14:28:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:20,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862201127] [2022-12-12 14:28:20,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862201127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:20,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:20,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:28:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604955227] [2022-12-12 14:28:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:20,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:28:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:20,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:28:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:28:20,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2022-12-12 14:28:20,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:28:20,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:20,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2022-12-12 14:28:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:20,317 INFO L130 PetriNetUnfolder]: 1106/2051 cut-off events. [2022-12-12 14:28:20,318 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 14:28:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 2051 events. 1106/2051 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12827 event pairs, 96 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 3864. Up to 1586 conditions per place. [2022-12-12 14:28:20,325 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 2 changer transitions 38/68 dead transitions. [2022-12-12 14:28:20,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 264 flow [2022-12-12 14:28:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:28:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:28:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-12 14:28:20,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-12 14:28:20,335 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 3 states and 87 transitions. [2022-12-12 14:28:20,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 264 flow [2022-12-12 14:28:20,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:28:20,338 INFO L231 Difference]: Finished difference. Result has 49 places, 23 transitions, 54 flow [2022-12-12 14:28:20,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=49, PETRI_TRANSITIONS=23} [2022-12-12 14:28:20,342 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-12 14:28:20,343 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 23 transitions, 54 flow [2022-12-12 14:28:20,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:28:20,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:20,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:20,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:28:20,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash -972105538, now seen corresponding path program 1 times [2022-12-12 14:28:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:20,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337424945] [2022-12-12 14:28:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:20,436 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-12 14:28:20,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337424945] [2022-12-12 14:28:20,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337424945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:20,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:28:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149425576] [2022-12-12 14:28:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:20,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:28:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:28:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:28:20,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-12 14:28:20,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:28:20,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:20,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-12 14:28:20,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:20,493 INFO L130 PetriNetUnfolder]: 206/406 cut-off events. [2022-12-12 14:28:20,493 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-12 14:28:20,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 406 events. 206/406 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1718 event pairs, 66 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 789. Up to 256 conditions per place. [2022-12-12 14:28:20,495 INFO L137 encePairwiseOnDemand]: 42/45 looper letters, 20 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2022-12-12 14:28:20,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 116 flow [2022-12-12 14:28:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:28:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:28:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-12 14:28:20,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2022-12-12 14:28:20,496 INFO L175 Difference]: Start difference. First operand has 49 places, 23 transitions, 54 flow. Second operand 3 states and 43 transitions. [2022-12-12 14:28:20,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 116 flow [2022-12-12 14:28:20,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:28:20,497 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 56 flow [2022-12-12 14:28:20,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-12 14:28:20,498 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -20 predicate places. [2022-12-12 14:28:20,498 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 56 flow [2022-12-12 14:28:20,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:28:20,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:20,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:28:20,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2110238765, now seen corresponding path program 1 times [2022-12-12 14:28:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:20,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327602047] [2022-12-12 14:28:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:20,661 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-12 14:28:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:20,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327602047] [2022-12-12 14:28:20,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327602047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:20,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:20,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:28:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831049763] [2022-12-12 14:28:20,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:20,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:28:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:28:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:28:20,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-12 14:28:20,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-12 14:28:20,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:20,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-12 14:28:20,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:20,779 INFO L130 PetriNetUnfolder]: 174/365 cut-off events. [2022-12-12 14:28:20,780 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-12 14:28:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 365 events. 174/365 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1657 event pairs, 37 based on Foata normal form. 42/313 useless extension candidates. Maximal degree in co-relation 788. Up to 244 conditions per place. [2022-12-12 14:28:20,782 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 24 selfloop transitions, 7 changer transitions 23/58 dead transitions. [2022-12-12 14:28:20,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 247 flow [2022-12-12 14:28:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:28:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:28:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-12 14:28:20,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-12 14:28:20,785 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 56 flow. Second operand 5 states and 81 transitions. [2022-12-12 14:28:20,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 247 flow [2022-12-12 14:28:20,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:28:20,787 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 115 flow [2022-12-12 14:28:20,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-12 14:28:20,788 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -16 predicate places. [2022-12-12 14:28:20,788 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 115 flow [2022-12-12 14:28:20,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-12 14:28:20,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:20,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:20,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:28:20,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1858868619, now seen corresponding path program 1 times [2022-12-12 14:28:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:20,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253129785] [2022-12-12 14:28:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:28:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:21,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253129785] [2022-12-12 14:28:21,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253129785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:21,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:21,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:28:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344055694] [2022-12-12 14:28:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:21,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:28:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:28:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:28:21,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-12 14:28:21,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 14:28:21,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:21,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-12 14:28:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:21,119 INFO L130 PetriNetUnfolder]: 64/186 cut-off events. [2022-12-12 14:28:21,120 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-12 14:28:21,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 186 events. 64/186 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 794 event pairs, 10 based on Foata normal form. 30/172 useless extension candidates. Maximal degree in co-relation 562. Up to 94 conditions per place. [2022-12-12 14:28:21,121 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 18 selfloop transitions, 13 changer transitions 13/47 dead transitions. [2022-12-12 14:28:21,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 269 flow [2022-12-12 14:28:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:28:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:28:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-12 14:28:21,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-12 14:28:21,124 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 115 flow. Second operand 6 states and 75 transitions. [2022-12-12 14:28:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 269 flow [2022-12-12 14:28:21,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 230 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-12 14:28:21,128 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 132 flow [2022-12-12 14:28:21,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-12 14:28:21,129 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-12-12 14:28:21,129 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 132 flow [2022-12-12 14:28:21,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-12 14:28:21,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:21,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:21,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:28:21,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1691757462, now seen corresponding path program 1 times [2022-12-12 14:28:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:21,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416285451] [2022-12-12 14:28:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:21,301 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-12 14:28:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:21,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416285451] [2022-12-12 14:28:21,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416285451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:21,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:21,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:28:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391447483] [2022-12-12 14:28:21,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:21,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:28:21,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:21,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:28:21,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:28:21,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-12 14:28:21,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-12 14:28:21,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:21,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-12 14:28:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:21,366 INFO L130 PetriNetUnfolder]: 50/179 cut-off events. [2022-12-12 14:28:21,366 INFO L131 PetriNetUnfolder]: For 162/168 co-relation queries the response was YES. [2022-12-12 14:28:21,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 179 events. 50/179 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 885 event pairs, 0 based on Foata normal form. 15/168 useless extension candidates. Maximal degree in co-relation 614. Up to 95 conditions per place. [2022-12-12 14:28:21,367 INFO L137 encePairwiseOnDemand]: 42/45 looper letters, 23 selfloop transitions, 1 changer transitions 18/47 dead transitions. [2022-12-12 14:28:21,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 316 flow [2022-12-12 14:28:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:28:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:28:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-12 14:28:21,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-12 14:28:21,368 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 132 flow. Second operand 4 states and 54 transitions. [2022-12-12 14:28:21,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 316 flow [2022-12-12 14:28:21,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 260 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-12 14:28:21,370 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 105 flow [2022-12-12 14:28:21,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-12 14:28:21,371 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -16 predicate places. [2022-12-12 14:28:21,371 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 105 flow [2022-12-12 14:28:21,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-12 14:28:21,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:21,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:28:21,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash 360715342, now seen corresponding path program 2 times [2022-12-12 14:28:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:21,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50269297] [2022-12-12 14:28:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:28:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:28:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:28:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50269297] [2022-12-12 14:28:22,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50269297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:28:22,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:28:22,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:28:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85230026] [2022-12-12 14:28:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:28:22,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:28:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:28:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:28:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:28:22,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-12 14:28:22,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-12 14:28:22,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:28:22,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-12 14:28:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:28:22,978 INFO L130 PetriNetUnfolder]: 42/170 cut-off events. [2022-12-12 14:28:22,978 INFO L131 PetriNetUnfolder]: For 90/98 co-relation queries the response was YES. [2022-12-12 14:28:22,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 170 events. 42/170 cut-off events. For 90/98 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 799 event pairs, 10 based on Foata normal form. 17/161 useless extension candidates. Maximal degree in co-relation 486. Up to 56 conditions per place. [2022-12-12 14:28:22,980 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 16 selfloop transitions, 4 changer transitions 28/54 dead transitions. [2022-12-12 14:28:22,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 334 flow [2022-12-12 14:28:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:28:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:28:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-12 14:28:22,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24722222222222223 [2022-12-12 14:28:22,982 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 105 flow. Second operand 8 states and 89 transitions. [2022-12-12 14:28:22,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 334 flow [2022-12-12 14:28:22,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:28:22,985 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 116 flow [2022-12-12 14:28:22,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-12 14:28:22,987 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-12-12 14:28:22,987 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 116 flow [2022-12-12 14:28:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-12 14:28:22,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:28:22,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:28:22,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:28:22,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 14:28:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:28:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash 962266072, now seen corresponding path program 3 times [2022-12-12 14:28:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:28:22,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273304772] [2022-12-12 14:28:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:28:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:28:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:28:23,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:28:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:28:23,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:28:23,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:28:23,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 14:28:23,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 14:28:23,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 14:28:23,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 14:28:23,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 14:28:23,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:28:23,093 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-12 14:28:23,100 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:28:23,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:28:23,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:28:23 BasicIcfg [2022-12-12 14:28:23,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:28:23,161 INFO L158 Benchmark]: Toolchain (without parser) took 8254.86ms. Allocated memory was 186.6MB in the beginning and 321.9MB in the end (delta: 135.3MB). Free memory was 162.3MB in the beginning and 258.8MB in the end (delta: -96.5MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. [2022-12-12 14:28:23,161 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 186.6MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:28:23,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.96ms. Allocated memory is still 186.6MB. Free memory was 161.8MB in the beginning and 135.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 14:28:23,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.27ms. Allocated memory is still 186.6MB. Free memory was 135.5MB in the beginning and 132.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:28:23,162 INFO L158 Benchmark]: Boogie Preprocessor took 21.02ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:28:23,162 INFO L158 Benchmark]: RCFGBuilder took 584.79ms. Allocated memory is still 186.6MB. Free memory was 130.9MB in the beginning and 95.7MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 14:28:23,162 INFO L158 Benchmark]: TraceAbstraction took 7162.75ms. Allocated memory was 186.6MB in the beginning and 321.9MB in the end (delta: 135.3MB). Free memory was 94.7MB in the beginning and 258.8MB in the end (delta: -164.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:28:23,164 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.39ms. Allocated memory is still 186.6MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 442.96ms. Allocated memory is still 186.6MB. Free memory was 161.8MB in the beginning and 135.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.27ms. Allocated memory is still 186.6MB. Free memory was 135.5MB in the beginning and 132.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.02ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 584.79ms. Allocated memory is still 186.6MB. Free memory was 130.9MB in the beginning and 95.7MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7162.75ms. Allocated memory was 186.6MB in the beginning and 321.9MB in the end (delta: 135.3MB). Free memory was 94.7MB in the beginning and 258.8MB in the end (delta: -164.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 92 PlacesBefore, 51 PlacesAfterwards, 87 TransitionsBefore, 45 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 4 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1719, independent: 1626, independent conditional: 1626, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1719, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1719, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1719, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1009, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1009, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1719, independent: 650, independent conditional: 0, independent unconditional: 650, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 1009, unknown conditional: 0, unknown unconditional: 1009] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1805, Positive conditional cache size: 0, Positive unconditional cache size: 1805, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t311, ((void *)0), P0, ((void *)0))=-2, t311={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t312, ((void *)0), P1, ((void *)0))=-1, t311={5:0}, t312={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L785] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L786] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L787] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L788] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L790] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 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) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 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 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 822]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 107 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-12 14:28:23,178 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...