/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:56:10,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:56:10,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:56:10,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:56:10,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:56:10,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:56:10,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:56:10,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:56:10,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:56:10,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:56:10,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:56:10,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:56:10,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:56:10,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:56:10,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:56:10,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:56:10,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:56:10,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:56:10,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:56:10,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:56:10,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:56:10,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:56:10,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:56:10,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:56:10,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:56:10,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:56:10,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:56:10,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:56:10,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:56:10,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:56:10,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:56:10,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:56:10,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:56:10,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:56:10,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:56:10,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:56:10,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:56:10,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:56:10,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:56:10,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:56:10,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:56:10,530 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-NoLbe.epf [2022-12-11 18:56:10,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:56:10,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:56:10,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:56:10,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:56:10,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:56:10,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:56:10,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:56:10,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:56:10,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:56:10,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:56:10,572 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-11 18:56:10,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:56:10,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:56:10,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:56:10,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:56:10,820 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:56:10,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-12-11 18:56:11,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:56:11,856 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:56:11,857 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-12-11 18:56:11,865 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d941e5383/9d58243c9bf443d6a7eaa4535f170ea1/FLAGb29b1d927 [2022-12-11 18:56:11,875 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d941e5383/9d58243c9bf443d6a7eaa4535f170ea1 [2022-12-11 18:56:11,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:56:11,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:56:11,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:56:11,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:56:11,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:56:11,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:56:11" (1/1) ... [2022-12-11 18:56:11,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b74b797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:11, skipping insertion in model container [2022-12-11 18:56:11,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:56:11" (1/1) ... [2022-12-11 18:56:11,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:56:11,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:56:12,060 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/mix003.oepc.i[945,958] [2022-12-11 18:56:12,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:56:12,283 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:56:12,291 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/mix003.oepc.i[945,958] [2022-12-11 18:56:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:56:12,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:56:12,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:56:12,379 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:56:12,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12 WrapperNode [2022-12-11 18:56:12,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:56:12,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:56:12,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:56:12,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:56:12,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,432 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-11 18:56:12,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:56:12,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:56:12,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:56:12,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:56:12,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,460 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:56:12,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:56:12,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:56:12,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:56:12,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (1/1) ... [2022-12-11 18:56:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:56:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:56:12,505 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-11 18:56:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:56:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 18:56:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:56:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:56:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:56:12,522 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-11 18:56:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 18:56:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 18:56:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 18:56:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 18:56:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 18:56:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 18:56:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:56:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 18:56:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:56:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:56:12,537 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 18:56:12,686 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:56:12,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:56:12,904 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:56:13,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:56:13,051 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 18:56:13,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:56:13 BoogieIcfgContainer [2022-12-11 18:56:13,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:56:13,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:56:13,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:56:13,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:56:13,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:56:11" (1/3) ... [2022-12-11 18:56:13,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214f6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:56:13, skipping insertion in model container [2022-12-11 18:56:13,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:56:12" (2/3) ... [2022-12-11 18:56:13,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214f6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:56:13, skipping insertion in model container [2022-12-11 18:56:13,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:56:13" (3/3) ... [2022-12-11 18:56:13,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2022-12-11 18:56:13,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:56:13,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 18:56:13,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:56:13,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 18:56:13,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-11 18:56:13,287 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-11 18:56:13,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:56:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-11 18:56:13,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-11 18:56:13,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-11 18:56:13,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:56:13,314 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;@50a42b07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:56:13,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 18:56:13,321 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-12-11 18:56:13,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:56:13,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:13,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:13,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash -370653572, now seen corresponding path program 1 times [2022-12-11 18:56:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800197730] [2022-12-11 18:56:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:13,731 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-11 18:56:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800197730] [2022-12-11 18:56:13,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800197730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:13,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:13,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 18:56:13,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504157095] [2022-12-11 18:56:13,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:13,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:56:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:56:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:56:13,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-12-11 18:56:13,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-11 18:56:13,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:13,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-12-11 18:56:13,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:13,908 INFO L130 PetriNetUnfolder]: 58/316 cut-off events. [2022-12-11 18:56:13,908 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 18:56:13,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 316 events. 58/316 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1393 event pairs, 44 based on Foata normal form. 19/315 useless extension candidates. Maximal degree in co-relation 393. Up to 79 conditions per place. [2022-12-11 18:56:13,913 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-12-11 18:56:13,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-12-11 18:56:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:56:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:56:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-12-11 18:56:13,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-12-11 18:56:13,929 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-12-11 18:56:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-12-11 18:56:13,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 18:56:13,936 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-12-11 18:56:13,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-12-11 18:56:13,940 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-12-11 18:56:13,940 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-12-11 18:56:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-11 18:56:13,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:13,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:56:13,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash -474226812, now seen corresponding path program 1 times [2022-12-11 18:56:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:13,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978915103] [2022-12-11 18:56:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:14,333 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-11 18:56:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:14,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978915103] [2022-12-11 18:56:14,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978915103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:14,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:14,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:56:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435701593] [2022-12-11 18:56:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:14,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:56:14,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:14,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:56:14,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:56:14,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2022-12-11 18:56:14,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 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-11 18:56:14,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:14,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2022-12-11 18:56:14,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:14,931 INFO L130 PetriNetUnfolder]: 1548/3719 cut-off events. [2022-12-11 18:56:14,931 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-11 18:56:14,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6264 conditions, 3719 events. 1548/3719 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 29669 event pairs, 252 based on Foata normal form. 0/3625 useless extension candidates. Maximal degree in co-relation 6208. Up to 1203 conditions per place. [2022-12-11 18:56:14,948 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 27 selfloop transitions, 4 changer transitions 64/167 dead transitions. [2022-12-11 18:56:14,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 167 transitions, 530 flow [2022-12-11 18:56:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:56:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:56:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 928 transitions. [2022-12-11 18:56:14,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8212389380530973 [2022-12-11 18:56:14,952 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 10 states and 928 transitions. [2022-12-11 18:56:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 167 transitions, 530 flow [2022-12-11 18:56:14,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 167 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:56:14,956 INFO L231 Difference]: Finished difference. Result has 129 places, 96 transitions, 222 flow [2022-12-11 18:56:14,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=129, PETRI_TRANSITIONS=96} [2022-12-11 18:56:14,957 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-12-11 18:56:14,957 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 222 flow [2022-12-11 18:56:14,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 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-11 18:56:14,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:14,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:56:14,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1878687358, now seen corresponding path program 1 times [2022-12-11 18:56:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223467509] [2022-12-11 18:56:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:15,192 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-11 18:56:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223467509] [2022-12-11 18:56:15,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223467509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:15,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:15,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:56:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974204284] [2022-12-11 18:56:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:15,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:56:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:56:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:56:15,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-12-11 18:56:15,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-11 18:56:15,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:15,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-12-11 18:56:15,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:15,464 INFO L130 PetriNetUnfolder]: 459/1067 cut-off events. [2022-12-11 18:56:15,464 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-11 18:56:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1067 events. 459/1067 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6084 event pairs, 155 based on Foata normal form. 27/1057 useless extension candidates. Maximal degree in co-relation 2021. Up to 374 conditions per place. [2022-12-11 18:56:15,468 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 21 selfloop transitions, 2 changer transitions 37/139 dead transitions. [2022-12-11 18:56:15,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 448 flow [2022-12-11 18:56:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 18:56:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 18:56:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-12-11 18:56:15,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8662733529990168 [2022-12-11 18:56:15,470 INFO L175 Difference]: Start difference. First operand has 129 places, 96 transitions, 222 flow. Second operand 9 states and 881 transitions. [2022-12-11 18:56:15,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 448 flow [2022-12-11 18:56:15,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 139 transitions, 412 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-11 18:56:15,477 INFO L231 Difference]: Finished difference. Result has 119 places, 96 transitions, 222 flow [2022-12-11 18:56:15,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=119, PETRI_TRANSITIONS=96} [2022-12-11 18:56:15,478 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2022-12-11 18:56:15,478 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 222 flow [2022-12-11 18:56:15,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-11 18:56:15,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:15,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:15,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:56:15,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2130478720, now seen corresponding path program 1 times [2022-12-11 18:56:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843691743] [2022-12-11 18:56:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:15,635 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-11 18:56:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843691743] [2022-12-11 18:56:15,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843691743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:15,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:15,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:56:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390706915] [2022-12-11 18:56:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:15,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:56:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:56:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:56:15,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-11 18:56:15,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-11 18:56:15,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:15,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-11 18:56:15,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:15,947 INFO L130 PetriNetUnfolder]: 917/1887 cut-off events. [2022-12-11 18:56:15,948 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-12-11 18:56:15,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1887 events. 917/1887 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12632 event pairs, 67 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 3555. Up to 481 conditions per place. [2022-12-11 18:56:15,953 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 31 selfloop transitions, 6 changer transitions 50/163 dead transitions. [2022-12-11 18:56:15,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 163 transitions, 534 flow [2022-12-11 18:56:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:56:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:56:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 979 transitions. [2022-12-11 18:56:15,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8663716814159292 [2022-12-11 18:56:15,956 INFO L175 Difference]: Start difference. First operand has 119 places, 96 transitions, 222 flow. Second operand 10 states and 979 transitions. [2022-12-11 18:56:15,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 163 transitions, 534 flow [2022-12-11 18:56:15,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 163 transitions, 518 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-11 18:56:15,960 INFO L231 Difference]: Finished difference. Result has 120 places, 98 transitions, 260 flow [2022-12-11 18:56:15,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=260, PETRI_PLACES=120, PETRI_TRANSITIONS=98} [2022-12-11 18:56:15,961 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2022-12-11 18:56:15,961 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 98 transitions, 260 flow [2022-12-11 18:56:15,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-11 18:56:15,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:15,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:15,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:56:15,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash 460077273, now seen corresponding path program 1 times [2022-12-11 18:56:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:15,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75875545] [2022-12-11 18:56:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:16,105 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-11 18:56:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:16,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75875545] [2022-12-11 18:56:16,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75875545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:16,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:16,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:56:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743696713] [2022-12-11 18:56:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:16,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:56:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:56:16,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:56:16,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-11 18:56:16,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 98 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-11 18:56:16,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:16,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-11 18:56:16,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:16,324 INFO L130 PetriNetUnfolder]: 316/804 cut-off events. [2022-12-11 18:56:16,324 INFO L131 PetriNetUnfolder]: For 616/616 co-relation queries the response was YES. [2022-12-11 18:56:16,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 804 events. 316/804 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4468 event pairs, 41 based on Foata normal form. 30/821 useless extension candidates. Maximal degree in co-relation 2004. Up to 182 conditions per place. [2022-12-11 18:56:16,327 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 37 selfloop transitions, 9 changer transitions 39/161 dead transitions. [2022-12-11 18:56:16,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 161 transitions, 689 flow [2022-12-11 18:56:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:56:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:56:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-12-11 18:56:16,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8646017699115044 [2022-12-11 18:56:16,329 INFO L175 Difference]: Start difference. First operand has 120 places, 98 transitions, 260 flow. Second operand 10 states and 977 transitions. [2022-12-11 18:56:16,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 161 transitions, 689 flow [2022-12-11 18:56:16,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 665 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-11 18:56:16,332 INFO L231 Difference]: Finished difference. Result has 124 places, 101 transitions, 328 flow [2022-12-11 18:56:16,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=328, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2022-12-11 18:56:16,333 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 6 predicate places. [2022-12-11 18:56:16,333 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 328 flow [2022-12-11 18:56:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-11 18:56:16,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:16,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:16,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 18:56:16,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1195276380, now seen corresponding path program 1 times [2022-12-11 18:56:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465103692] [2022-12-11 18:56:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:16,506 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-11 18:56:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:16,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465103692] [2022-12-11 18:56:16,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465103692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:16,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:16,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 18:56:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129241168] [2022-12-11 18:56:16,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:16,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 18:56:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 18:56:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 18:56:16,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-11 18:56:16,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-11 18:56:16,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:16,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-11 18:56:16,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:16,680 INFO L130 PetriNetUnfolder]: 108/372 cut-off events. [2022-12-11 18:56:16,681 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-11 18:56:16,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 372 events. 108/372 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1638 event pairs, 25 based on Foata normal form. 9/372 useless extension candidates. Maximal degree in co-relation 955. Up to 71 conditions per place. [2022-12-11 18:56:16,682 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 26 selfloop transitions, 12 changer transitions 23/137 dead transitions. [2022-12-11 18:56:16,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 137 transitions, 628 flow [2022-12-11 18:56:16,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 18:56:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 18:56:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1042 transitions. [2022-12-11 18:56:16,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8382944489139179 [2022-12-11 18:56:16,684 INFO L175 Difference]: Start difference. First operand has 124 places, 101 transitions, 328 flow. Second operand 11 states and 1042 transitions. [2022-12-11 18:56:16,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 137 transitions, 628 flow [2022-12-11 18:56:16,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 525 flow, removed 40 selfloop flow, removed 11 redundant places. [2022-12-11 18:56:16,688 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 310 flow [2022-12-11 18:56:16,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-12-11 18:56:16,688 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2022-12-11 18:56:16,689 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 310 flow [2022-12-11 18:56:16,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-11 18:56:16,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:16,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:56:16,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1408091317, now seen corresponding path program 1 times [2022-12-11 18:56:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:16,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027420269] [2022-12-11 18:56:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:16,882 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-11 18:56:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027420269] [2022-12-11 18:56:16,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027420269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:16,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:16,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:56:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279832419] [2022-12-11 18:56:16,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:16,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:56:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:16,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:56:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:56:16,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-12-11 18:56:16,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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-11 18:56:16,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:16,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-12-11 18:56:16,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:17,074 INFO L130 PetriNetUnfolder]: 186/594 cut-off events. [2022-12-11 18:56:17,075 INFO L131 PetriNetUnfolder]: For 301/311 co-relation queries the response was YES. [2022-12-11 18:56:17,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 594 events. 186/594 cut-off events. For 301/311 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3088 event pairs, 36 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 1220. Up to 174 conditions per place. [2022-12-11 18:56:17,077 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 30 selfloop transitions, 9 changer transitions 5/119 dead transitions. [2022-12-11 18:56:17,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 119 transitions, 434 flow [2022-12-11 18:56:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 18:56:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 18:56:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 701 transitions. [2022-12-11 18:56:17,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7754424778761062 [2022-12-11 18:56:17,079 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 310 flow. Second operand 8 states and 701 transitions. [2022-12-11 18:56:17,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 119 transitions, 434 flow [2022-12-11 18:56:17,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 352 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-12-11 18:56:17,082 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 279 flow [2022-12-11 18:56:17,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=279, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2022-12-11 18:56:17,082 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2022-12-11 18:56:17,082 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 279 flow [2022-12-11 18:56:17,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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-11 18:56:17,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:17,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:17,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 18:56:17,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash -4473765, now seen corresponding path program 2 times [2022-12-11 18:56:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:17,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077367873] [2022-12-11 18:56:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:17,708 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-11 18:56:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077367873] [2022-12-11 18:56:17,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077367873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:17,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 18:56:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055675661] [2022-12-11 18:56:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:17,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 18:56:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 18:56:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-11 18:56:17,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-12-11 18:56:17,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 279 flow. Second operand has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 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-11 18:56:17,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:17,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-12-11 18:56:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:17,933 INFO L130 PetriNetUnfolder]: 133/718 cut-off events. [2022-12-11 18:56:17,933 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-11 18:56:17,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 718 events. 133/718 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4896 event pairs, 21 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 1209. Up to 82 conditions per place. [2022-12-11 18:56:17,936 INFO L137 encePairwiseOnDemand]: 102/113 looper letters, 35 selfloop transitions, 8 changer transitions 11/136 dead transitions. [2022-12-11 18:56:17,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 491 flow [2022-12-11 18:56:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:56:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:56:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 911 transitions. [2022-12-11 18:56:17,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8061946902654867 [2022-12-11 18:56:17,938 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 279 flow. Second operand 10 states and 911 transitions. [2022-12-11 18:56:17,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 491 flow [2022-12-11 18:56:17,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 136 transitions, 466 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-11 18:56:17,940 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 325 flow [2022-12-11 18:56:17,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=325, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2022-12-11 18:56:17,941 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2022-12-11 18:56:17,941 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 325 flow [2022-12-11 18:56:17,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 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-11 18:56:17,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:17,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:17,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 18:56:17,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1601106795, now seen corresponding path program 3 times [2022-12-11 18:56:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:17,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474706663] [2022-12-11 18:56:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:56:18,115 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-11 18:56:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:56:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474706663] [2022-12-11 18:56:18,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474706663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:56:18,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:56:18,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:56:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459883532] [2022-12-11 18:56:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:56:18,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:56:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:56:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:56:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:56:18,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-12-11 18:56:18,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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-11 18:56:18,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:56:18,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-12-11 18:56:18,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:56:18,330 INFO L130 PetriNetUnfolder]: 319/1131 cut-off events. [2022-12-11 18:56:18,330 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2022-12-11 18:56:18,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 1131 events. 319/1131 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8252 event pairs, 37 based on Foata normal form. 2/1099 useless extension candidates. Maximal degree in co-relation 2567. Up to 349 conditions per place. [2022-12-11 18:56:18,334 INFO L137 encePairwiseOnDemand]: 99/113 looper letters, 33 selfloop transitions, 13 changer transitions 17/138 dead transitions. [2022-12-11 18:56:18,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 583 flow [2022-12-11 18:56:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 18:56:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 18:56:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2022-12-11 18:56:18,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7776548672566371 [2022-12-11 18:56:18,336 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 325 flow. Second operand 8 states and 703 transitions. [2022-12-11 18:56:18,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 583 flow [2022-12-11 18:56:18,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 554 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-11 18:56:18,338 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 397 flow [2022-12-11 18:56:18,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2022-12-11 18:56:18,339 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2022-12-11 18:56:18,339 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 397 flow [2022-12-11 18:56:18,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 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-11 18:56:18,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:56:18,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 18:56:18,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:56:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:56:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 704160903, now seen corresponding path program 4 times [2022-12-11 18:56:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:56:18,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53082596] [2022-12-11 18:56:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:56:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:56:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:56:18,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 18:56:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:56:18,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 18:56:18,419 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 18:56:18,420 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 18:56:18,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 18:56:18,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 18:56:18,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 18:56:18,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 18:56:18,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 18:56:18,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 18:56:18,422 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-11 18:56:18,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 18:56:18,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 18:56:18,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 06:56:18 BasicIcfg [2022-12-11 18:56:18,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 18:56:18,496 INFO L158 Benchmark]: Toolchain (without parser) took 6619.23ms. Allocated memory was 177.2MB in the beginning and 345.0MB in the end (delta: 167.8MB). Free memory was 133.7MB in the beginning and 311.8MB in the end (delta: -178.1MB). Peak memory consumption was 155.5MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,496 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 18:56:18,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.21ms. Allocated memory is still 177.2MB. Free memory was 133.7MB in the beginning and 144.1MB in the end (delta: -10.5MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.00ms. Allocated memory is still 177.2MB. Free memory was 144.1MB in the beginning and 141.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,497 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 177.2MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,497 INFO L158 Benchmark]: RCFGBuilder took 589.54ms. Allocated memory is still 177.2MB. Free memory was 140.0MB in the beginning and 105.9MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,498 INFO L158 Benchmark]: TraceAbstraction took 5441.60ms. Allocated memory was 177.2MB in the beginning and 345.0MB in the end (delta: 167.8MB). Free memory was 104.3MB in the beginning and 311.8MB in the end (delta: -207.5MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. [2022-12-11 18:56:18,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.21ms. Allocated memory is still 177.2MB. Free memory was 133.7MB in the beginning and 144.1MB in the end (delta: -10.5MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.00ms. Allocated memory is still 177.2MB. Free memory was 144.1MB in the beginning and 141.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 177.2MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.54ms. Allocated memory is still 177.2MB. Free memory was 140.0MB in the beginning and 105.9MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5441.60ms. Allocated memory was 177.2MB in the beginning and 345.0MB in the end (delta: 167.8MB). Free memory was 104.3MB in the beginning and 311.8MB in the end (delta: -207.5MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 95 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=9, InterpolantAutomatonStates: 79, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 3471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11 18:56:18,512 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...