/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/mix018_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:24:19,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:24:19,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:24:19,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:24:19,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:24:19,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:24:19,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:24:19,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:24:19,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:24:19,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:24:19,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:24:19,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:24:19,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:24:19,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:24:19,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:24:19,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:24:19,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:24:19,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:24:19,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:24:19,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:24:19,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:24:19,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:24:19,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:24:19,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:24:19,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:24:19,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:24:19,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:24:19,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:24:19,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:24:19,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:24:19,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:24:19,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:24:19,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:24:19,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:24:19,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:24:19,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:24:19,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:24:19,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:24:19,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:24:19,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:24:19,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:24:19,747 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-09-20 22:24:19,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:24:19,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:24:19,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:24:19,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:24:19,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:24:19,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:24:19,772 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:24:19,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:24:19,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:24:19,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:24:19,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:24:19,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:24:19,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:24:19,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:24:19,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:24:19,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:24:19,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:24:19,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:19,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:24:19,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:24:19,775 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-09-20 22:24:19,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:24:19,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:24:19,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:24:19,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:24:19,983 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:24:19,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:24:20,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a2b55ac/953f67988ec0434bbb80f3a805934414/FLAG9ddea62fe [2022-09-20 22:24:20,431 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:24:20,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:24:20,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a2b55ac/953f67988ec0434bbb80f3a805934414/FLAG9ddea62fe [2022-09-20 22:24:20,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a2b55ac/953f67988ec0434bbb80f3a805934414 [2022-09-20 22:24:20,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:24:20,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:24:20,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:20,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:24:20,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:24:20,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:20" (1/1) ... [2022-09-20 22:24:20,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15143399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:20, skipping insertion in model container [2022-09-20 22:24:20,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:20" (1/1) ... [2022-09-20 22:24:20,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:24:20,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:24:21,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:24:21,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:21,297 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:24:21,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:24:21,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:21,353 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:24:21,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21 WrapperNode [2022-09-20 22:24:21,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:21,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:21,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:24:21,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:24:21,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,390 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-09-20 22:24:21,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:21,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:24:21,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:24:21,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:24:21,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:24:21,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:24:21,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:24:21,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:24:21,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (1/1) ... [2022-09-20 22:24:21,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:24:21,466 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-09-20 22:24:21,491 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-09-20 22:24:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:24:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:24:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:24:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:24:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:24:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:24:21,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:24:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:24:21,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:24:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:24:21,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:24:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:24:21,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:24:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:24:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:24:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:24:21,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:24:21,505 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:24:21,608 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:24:21,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:24:22,058 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:24:22,324 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:24:22,325 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:24:22,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:22 BoogieIcfgContainer [2022-09-20 22:24:22,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:24:22,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:24:22,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:24:22,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:24:22,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:24:20" (1/3) ... [2022-09-20 22:24:22,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3a9a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:22, skipping insertion in model container [2022-09-20 22:24:22,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:21" (2/3) ... [2022-09-20 22:24:22,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3a9a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:22, skipping insertion in model container [2022-09-20 22:24:22,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:22" (3/3) ... [2022-09-20 22:24:22,334 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:24:22,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:24:22,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:24:22,347 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:24:22,403 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:24:22,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-09-20 22:24:22,481 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-09-20 22:24:22,481 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:22,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-09-20 22:24:22,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-09-20 22:24:22,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-09-20 22:24:22,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:24:22,506 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;@71550b0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:24:22,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:24:22,522 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-09-20 22:24:22,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:22,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:22,523 INFO L208 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] [2022-09-20 22:24:22,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1436643446, now seen corresponding path program 1 times [2022-09-20 22:24:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520470407] [2022-09-20 22:24:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520470407] [2022-09-20 22:24:22,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520470407] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:22,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:22,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:24:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127314820] [2022-09-20 22:24:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:22,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:24:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:24:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:24:22,799 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 138 [2022-09-20 22:24:22,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-09-20 22:24:22,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:22,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 138 [2022-09-20 22:24:22,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:23,022 INFO L130 PetriNetUnfolder]: 162/548 cut-off events. [2022-09-20 22:24:23,022 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-09-20 22:24:23,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 548 events. 162/548 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2848 event pairs, 34 based on Foata normal form. 49/568 useless extension candidates. Maximal degree in co-relation 796. Up to 191 conditions per place. [2022-09-20 22:24:23,031 INFO L137 encePairwiseOnDemand]: 133/138 looper letters, 18 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2022-09-20 22:24:23,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 337 flow [2022-09-20 22:24:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:24:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:24:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-09-20 22:24:23,042 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2022-09-20 22:24:23,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2022-09-20 22:24:23,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2022-09-20 22:24:23,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:23,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2022-09-20 22:24:23,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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-09-20 22:24:23,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-09-20 22:24:23,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-09-20 22:24:23,053 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 391 transitions. [2022-09-20 22:24:23,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 337 flow [2022-09-20 22:24:23,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 330 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:23,058 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-09-20 22:24:23,060 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-09-20 22:24:23,062 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-09-20 22:24:23,062 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-09-20 22:24:23,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-09-20 22:24:23,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:23,062 INFO L208 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] [2022-09-20 22:24:23,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:24:23,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1501495155, now seen corresponding path program 1 times [2022-09-20 22:24:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874306010] [2022-09-20 22:24:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874306010] [2022-09-20 22:24:23,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874306010] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:23,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:23,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901521427] [2022-09-20 22:24:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:23,244 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 138 [2022-09-20 22:24:23,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-09-20 22:24:23,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:23,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 138 [2022-09-20 22:24:23,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:26,110 INFO L130 PetriNetUnfolder]: 10039/22699 cut-off events. [2022-09-20 22:24:26,110 INFO L131 PetriNetUnfolder]: For 635/635 co-relation queries the response was YES. [2022-09-20 22:24:26,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37367 conditions, 22699 events. 10039/22699 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 232014 event pairs, 2856 based on Foata normal form. 0/22075 useless extension candidates. Maximal degree in co-relation 37306. Up to 6487 conditions per place. [2022-09-20 22:24:26,260 INFO L137 encePairwiseOnDemand]: 125/138 looper letters, 36 selfloop transitions, 9 changer transitions 90/224 dead transitions. [2022-09-20 22:24:26,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 224 transitions, 722 flow [2022-09-20 22:24:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:24:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:24:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-09-20 22:24:26,263 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8679549114331723 [2022-09-20 22:24:26,264 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-09-20 22:24:26,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-09-20 22:24:26,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:26,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-09-20 22:24:26,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 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-09-20 22:24:26,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 22:24:26,269 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 22:24:26,270 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 9 states and 1078 transitions. [2022-09-20 22:24:26,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 224 transitions, 722 flow [2022-09-20 22:24:26,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 224 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:24:26,273 INFO L231 Difference]: Finished difference. Result has 155 places, 122 transitions, 350 flow [2022-09-20 22:24:26,274 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=350, PETRI_PLACES=155, PETRI_TRANSITIONS=122} [2022-09-20 22:24:26,274 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2022-09-20 22:24:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 122 transitions, 350 flow [2022-09-20 22:24:26,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-09-20 22:24:26,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:26,275 INFO L208 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] [2022-09-20 22:24:26,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:24:26,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -954209524, now seen corresponding path program 1 times [2022-09-20 22:24:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786721761] [2022-09-20 22:24:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:26,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786721761] [2022-09-20 22:24:26,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786721761] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:26,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:26,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051339406] [2022-09-20 22:24:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:26,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:26,394 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 138 [2022-09-20 22:24:26,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 122 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:24:26,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:26,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 138 [2022-09-20 22:24:26,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:28,273 INFO L130 PetriNetUnfolder]: 7126/12302 cut-off events. [2022-09-20 22:24:28,273 INFO L131 PetriNetUnfolder]: For 19192/19198 co-relation queries the response was YES. [2022-09-20 22:24:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37148 conditions, 12302 events. 7126/12302 cut-off events. For 19192/19198 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 92940 event pairs, 806 based on Foata normal form. 264/12415 useless extension candidates. Maximal degree in co-relation 37075. Up to 4199 conditions per place. [2022-09-20 22:24:28,403 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 46 selfloop transitions, 8 changer transitions 103/246 dead transitions. [2022-09-20 22:24:28,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 246 transitions, 1302 flow [2022-09-20 22:24:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:24:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:24:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1521 transitions. [2022-09-20 22:24:28,407 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-09-20 22:24:28,407 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1521 transitions. [2022-09-20 22:24:28,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1521 transitions. [2022-09-20 22:24:28,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:28,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1521 transitions. [2022-09-20 22:24:28,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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-09-20 22:24:28,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:28,414 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:28,414 INFO L175 Difference]: Start difference. First operand has 155 places, 122 transitions, 350 flow. Second operand 13 states and 1521 transitions. [2022-09-20 22:24:28,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 246 transitions, 1302 flow [2022-09-20 22:24:28,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 246 transitions, 1192 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-09-20 22:24:28,480 INFO L231 Difference]: Finished difference. Result has 157 places, 126 transitions, 426 flow [2022-09-20 22:24:28,480 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=426, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2022-09-20 22:24:28,481 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 12 predicate places. [2022-09-20 22:24:28,481 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 426 flow [2022-09-20 22:24:28,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:24:28,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:28,482 INFO L208 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-09-20 22:24:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:24:28,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2021352477, now seen corresponding path program 1 times [2022-09-20 22:24:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:28,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260878041] [2022-09-20 22:24:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260878041] [2022-09-20 22:24:28,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260878041] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:28,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:28,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777371276] [2022-09-20 22:24:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:28,582 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 138 [2022-09-20 22:24:28,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 426 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:24:28,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:28,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 138 [2022-09-20 22:24:28,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:30,389 INFO L130 PetriNetUnfolder]: 6025/10819 cut-off events. [2022-09-20 22:24:30,390 INFO L131 PetriNetUnfolder]: For 27903/27933 co-relation queries the response was YES. [2022-09-20 22:24:30,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35399 conditions, 10819 events. 6025/10819 cut-off events. For 27903/27933 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 82582 event pairs, 1683 based on Foata normal form. 222/10830 useless extension candidates. Maximal degree in co-relation 35316. Up to 4022 conditions per place. [2022-09-20 22:24:30,460 INFO L137 encePairwiseOnDemand]: 125/138 looper letters, 46 selfloop transitions, 18 changer transitions 85/238 dead transitions. [2022-09-20 22:24:30,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 238 transitions, 1388 flow [2022-09-20 22:24:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:24:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:24:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1521 transitions. [2022-09-20 22:24:30,464 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-09-20 22:24:30,464 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1521 transitions. [2022-09-20 22:24:30,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1521 transitions. [2022-09-20 22:24:30,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:30,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1521 transitions. [2022-09-20 22:24:30,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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-09-20 22:24:30,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:30,469 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:30,469 INFO L175 Difference]: Start difference. First operand has 157 places, 126 transitions, 426 flow. Second operand 13 states and 1521 transitions. [2022-09-20 22:24:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 238 transitions, 1388 flow [2022-09-20 22:24:30,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 238 transitions, 1305 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-09-20 22:24:30,565 INFO L231 Difference]: Finished difference. Result has 164 places, 132 transitions, 549 flow [2022-09-20 22:24:30,565 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=549, PETRI_PLACES=164, PETRI_TRANSITIONS=132} [2022-09-20 22:24:30,567 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 19 predicate places. [2022-09-20 22:24:30,567 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 132 transitions, 549 flow [2022-09-20 22:24:30,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:24:30,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:30,573 INFO L208 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, 1, 1] [2022-09-20 22:24:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:24:30,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1361589100, now seen corresponding path program 1 times [2022-09-20 22:24:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694769829] [2022-09-20 22:24:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694769829] [2022-09-20 22:24:30,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694769829] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:30,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:30,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245122394] [2022-09-20 22:24:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:30,695 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 22:24:30,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 132 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-09-20 22:24:30,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:30,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 22:24:30,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:34,623 INFO L130 PetriNetUnfolder]: 15552/27563 cut-off events. [2022-09-20 22:24:34,624 INFO L131 PetriNetUnfolder]: For 31851/38372 co-relation queries the response was YES. [2022-09-20 22:24:34,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66839 conditions, 27563 events. 15552/27563 cut-off events. For 31851/38372 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 242791 event pairs, 1273 based on Foata normal form. 15/26313 useless extension candidates. Maximal degree in co-relation 66751. Up to 8319 conditions per place. [2022-09-20 22:24:35,026 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 93 selfloop transitions, 20 changer transitions 0/221 dead transitions. [2022-09-20 22:24:35,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 221 transitions, 1078 flow [2022-09-20 22:24:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:24:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:24:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1217 transitions. [2022-09-20 22:24:35,030 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8818840579710145 [2022-09-20 22:24:35,030 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1217 transitions. [2022-09-20 22:24:35,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1217 transitions. [2022-09-20 22:24:35,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:35,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1217 transitions. [2022-09-20 22:24:35,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.7) internal successors, (1217), 10 states have internal predecessors, (1217), 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-09-20 22:24:35,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 22:24:35,034 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-09-20 22:24:35,035 INFO L175 Difference]: Start difference. First operand has 164 places, 132 transitions, 549 flow. Second operand 10 states and 1217 transitions. [2022-09-20 22:24:35,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 221 transitions, 1078 flow [2022-09-20 22:24:35,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 221 transitions, 1012 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-09-20 22:24:35,176 INFO L231 Difference]: Finished difference. Result has 155 places, 150 transitions, 626 flow [2022-09-20 22:24:35,176 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=626, PETRI_PLACES=155, PETRI_TRANSITIONS=150} [2022-09-20 22:24:35,179 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2022-09-20 22:24:35,179 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 150 transitions, 626 flow [2022-09-20 22:24:35,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-09-20 22:24:35,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:35,179 INFO L208 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, 1, 1, 1, 1, 1] [2022-09-20 22:24:35,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:24:35,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -991667726, now seen corresponding path program 1 times [2022-09-20 22:24:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:35,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915712612] [2022-09-20 22:24:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:35,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915712612] [2022-09-20 22:24:35,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915712612] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:35,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:35,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398749807] [2022-09-20 22:24:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:35,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:35,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-09-20 22:24:35,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 150 transitions, 626 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-09-20 22:24:35,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:35,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-09-20 22:24:35,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:37,501 INFO L130 PetriNetUnfolder]: 6061/16708 cut-off events. [2022-09-20 22:24:37,501 INFO L131 PetriNetUnfolder]: For 21556/23730 co-relation queries the response was YES. [2022-09-20 22:24:37,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44564 conditions, 16708 events. 6061/16708 cut-off events. For 21556/23730 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 194642 event pairs, 2551 based on Foata normal form. 324/15930 useless extension candidates. Maximal degree in co-relation 44482. Up to 2846 conditions per place. [2022-09-20 22:24:37,831 INFO L137 encePairwiseOnDemand]: 132/138 looper letters, 63 selfloop transitions, 16 changer transitions 4/203 dead transitions. [2022-09-20 22:24:37,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 203 transitions, 1008 flow [2022-09-20 22:24:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:24:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:24:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1093 transitions. [2022-09-20 22:24:37,834 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8800322061191627 [2022-09-20 22:24:37,834 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1093 transitions. [2022-09-20 22:24:37,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1093 transitions. [2022-09-20 22:24:37,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:37,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1093 transitions. [2022-09-20 22:24:37,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.44444444444444) internal successors, (1093), 9 states have internal predecessors, (1093), 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-09-20 22:24:37,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 22:24:37,839 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-09-20 22:24:37,839 INFO L175 Difference]: Start difference. First operand has 155 places, 150 transitions, 626 flow. Second operand 9 states and 1093 transitions. [2022-09-20 22:24:37,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 203 transitions, 1008 flow [2022-09-20 22:24:37,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 203 transitions, 1006 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:24:37,975 INFO L231 Difference]: Finished difference. Result has 169 places, 157 transitions, 745 flow [2022-09-20 22:24:37,975 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=169, PETRI_TRANSITIONS=157} [2022-09-20 22:24:37,976 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 24 predicate places. [2022-09-20 22:24:37,977 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 157 transitions, 745 flow [2022-09-20 22:24:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 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-09-20 22:24:37,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:37,977 INFO L208 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, 1, 1, 1, 1, 1] [2022-09-20 22:24:37,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:24:37,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1950809316, now seen corresponding path program 1 times [2022-09-20 22:24:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:37,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825616107] [2022-09-20 22:24:37,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825616107] [2022-09-20 22:24:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825616107] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:38,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:38,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331582152] [2022-09-20 22:24:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:38,102 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 22:24:38,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 157 transitions, 745 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-09-20 22:24:38,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:38,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 22:24:38,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:43,186 INFO L130 PetriNetUnfolder]: 19559/35622 cut-off events. [2022-09-20 22:24:43,187 INFO L131 PetriNetUnfolder]: For 67181/74301 co-relation queries the response was YES. [2022-09-20 22:24:43,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111719 conditions, 35622 events. 19559/35622 cut-off events. For 67181/74301 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 339544 event pairs, 1300 based on Foata normal form. 642/35192 useless extension candidates. Maximal degree in co-relation 111630. Up to 7379 conditions per place. [2022-09-20 22:24:43,671 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 121 selfloop transitions, 38 changer transitions 0/274 dead transitions. [2022-09-20 22:24:43,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 274 transitions, 1673 flow [2022-09-20 22:24:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:24:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:24:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1587 transitions. [2022-09-20 22:24:43,675 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8846153846153846 [2022-09-20 22:24:43,675 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1587 transitions. [2022-09-20 22:24:43,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1587 transitions. [2022-09-20 22:24:43,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:43,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1587 transitions. [2022-09-20 22:24:43,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.07692307692308) internal successors, (1587), 13 states have internal predecessors, (1587), 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-09-20 22:24:43,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:43,682 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:24:43,682 INFO L175 Difference]: Start difference. First operand has 169 places, 157 transitions, 745 flow. Second operand 13 states and 1587 transitions. [2022-09-20 22:24:43,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 274 transitions, 1673 flow [2022-09-20 22:24:44,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 274 transitions, 1655 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-09-20 22:24:44,293 INFO L231 Difference]: Finished difference. Result has 186 places, 177 transitions, 1020 flow [2022-09-20 22:24:44,294 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1020, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2022-09-20 22:24:44,294 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 41 predicate places. [2022-09-20 22:24:44,294 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 1020 flow [2022-09-20 22:24:44,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-09-20 22:24:44,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:44,295 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:44,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:24:44,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1792516189, now seen corresponding path program 1 times [2022-09-20 22:24:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:44,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109811771] [2022-09-20 22:24:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:44,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109811771] [2022-09-20 22:24:44,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109811771] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:44,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:44,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:24:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894471583] [2022-09-20 22:24:44,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:44,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:24:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:44,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:24:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:24:44,394 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 22:24:44,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 1020 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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-09-20 22:24:44,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:44,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 22:24:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:49,788 INFO L130 PetriNetUnfolder]: 18755/34547 cut-off events. [2022-09-20 22:24:49,789 INFO L131 PetriNetUnfolder]: For 116980/124460 co-relation queries the response was YES. [2022-09-20 22:24:50,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129190 conditions, 34547 events. 18755/34547 cut-off events. For 116980/124460 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 337293 event pairs, 868 based on Foata normal form. 447/34033 useless extension candidates. Maximal degree in co-relation 129093. Up to 7158 conditions per place. [2022-09-20 22:24:50,341 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 114 selfloop transitions, 58 changer transitions 43/322 dead transitions. [2022-09-20 22:24:50,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 322 transitions, 2367 flow [2022-09-20 22:24:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:24:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:24:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1956 transitions. [2022-09-20 22:24:50,345 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8858695652173914 [2022-09-20 22:24:50,345 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1956 transitions. [2022-09-20 22:24:50,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1956 transitions. [2022-09-20 22:24:50,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:50,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1956 transitions. [2022-09-20 22:24:50,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 122.25) internal successors, (1956), 16 states have internal predecessors, (1956), 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-09-20 22:24:50,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 22:24:50,352 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-09-20 22:24:50,352 INFO L175 Difference]: Start difference. First operand has 186 places, 177 transitions, 1020 flow. Second operand 16 states and 1956 transitions. [2022-09-20 22:24:50,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 322 transitions, 2367 flow [2022-09-20 22:24:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 322 transitions, 2256 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-09-20 22:24:56,317 INFO L231 Difference]: Finished difference. Result has 200 places, 195 transitions, 1294 flow [2022-09-20 22:24:56,317 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1294, PETRI_PLACES=200, PETRI_TRANSITIONS=195} [2022-09-20 22:24:56,318 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 55 predicate places. [2022-09-20 22:24:56,318 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 195 transitions, 1294 flow [2022-09-20 22:24:56,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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-09-20 22:24:56,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:56,319 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:24:56,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1304862124, now seen corresponding path program 1 times [2022-09-20 22:24:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:56,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118706973] [2022-09-20 22:24:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118706973] [2022-09-20 22:24:56,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118706973] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:56,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:56,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:24:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229185160] [2022-09-20 22:24:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:56,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:24:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:56,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:24:56,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:24:56,428 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-09-20 22:24:56,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 195 transitions, 1294 flow. Second operand has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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-09-20 22:24:56,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:56,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-09-20 22:24:56,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:01,817 INFO L130 PetriNetUnfolder]: 18535/33849 cut-off events. [2022-09-20 22:25:01,818 INFO L131 PetriNetUnfolder]: For 121022/128228 co-relation queries the response was YES. [2022-09-20 22:25:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126777 conditions, 33849 events. 18535/33849 cut-off events. For 121022/128228 co-relation queries the response was YES. Maximal size of possible extension queue 2124. Compared 327246 event pairs, 1103 based on Foata normal form. 216/33014 useless extension candidates. Maximal degree in co-relation 126738. Up to 4152 conditions per place. [2022-09-20 22:25:02,371 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 101 selfloop transitions, 63 changer transitions 42/313 dead transitions. [2022-09-20 22:25:02,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 313 transitions, 2382 flow [2022-09-20 22:25:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:25:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:25:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2274 transitions. [2022-09-20 22:25:02,375 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8672768878718535 [2022-09-20 22:25:02,375 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2274 transitions. [2022-09-20 22:25:02,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2274 transitions. [2022-09-20 22:25:02,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:02,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2274 transitions. [2022-09-20 22:25:02,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.6842105263158) internal successors, (2274), 19 states have internal predecessors, (2274), 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-09-20 22:25:02,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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-09-20 22:25:02,382 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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-09-20 22:25:02,382 INFO L175 Difference]: Start difference. First operand has 200 places, 195 transitions, 1294 flow. Second operand 19 states and 2274 transitions. [2022-09-20 22:25:02,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 313 transitions, 2382 flow [2022-09-20 22:25:09,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 313 transitions, 1973 flow, removed 160 selfloop flow, removed 18 redundant places. [2022-09-20 22:25:10,002 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 1128 flow [2022-09-20 22:25:10,002 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1128, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2022-09-20 22:25:10,003 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 56 predicate places. [2022-09-20 22:25:10,003 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 1128 flow [2022-09-20 22:25:10,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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-09-20 22:25:10,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:10,003 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:25:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:25:10,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:25:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1773663892, now seen corresponding path program 1 times [2022-09-20 22:25:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078279246] [2022-09-20 22:25:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:25:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:10,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078279246] [2022-09-20 22:25:10,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078279246] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:10,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:10,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:25:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744365610] [2022-09-20 22:25:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:25:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:25:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:25:10,164 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-09-20 22:25:10,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 1128 flow. Second operand has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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-09-20 22:25:10,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:10,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-09-20 22:25:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:12,014 INFO L130 PetriNetUnfolder]: 5263/16312 cut-off events. [2022-09-20 22:25:12,014 INFO L131 PetriNetUnfolder]: For 38184/40732 co-relation queries the response was YES. [2022-09-20 22:25:12,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53513 conditions, 16312 events. 5263/16312 cut-off events. For 38184/40732 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 223036 event pairs, 85 based on Foata normal form. 3/15196 useless extension candidates. Maximal degree in co-relation 53410. Up to 1817 conditions per place. [2022-09-20 22:25:12,554 INFO L137 encePairwiseOnDemand]: 124/138 looper letters, 49 selfloop transitions, 24 changer transitions 12/235 dead transitions. [2022-09-20 22:25:12,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 235 transitions, 1563 flow [2022-09-20 22:25:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 22:25:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 22:25:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 896 transitions. [2022-09-20 22:25:12,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8115942028985508 [2022-09-20 22:25:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 896 transitions. [2022-09-20 22:25:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 896 transitions. [2022-09-20 22:25:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:12,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 896 transitions. [2022-09-20 22:25:12,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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-09-20 22:25:12,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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-09-20 22:25:12,584 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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-09-20 22:25:12,584 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 1128 flow. Second operand 8 states and 896 transitions. [2022-09-20 22:25:12,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 235 transitions, 1563 flow [2022-09-20 22:25:14,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 235 transitions, 1369 flow, removed 49 selfloop flow, removed 17 redundant places. [2022-09-20 22:25:14,622 INFO L231 Difference]: Finished difference. Result has 194 places, 205 transitions, 1171 flow [2022-09-20 22:25:14,623 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1171, PETRI_PLACES=194, PETRI_TRANSITIONS=205} [2022-09-20 22:25:14,631 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 49 predicate places. [2022-09-20 22:25:14,631 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 205 transitions, 1171 flow [2022-09-20 22:25:14,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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-09-20 22:25:14,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:14,636 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:25:14,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:25:14,636 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:25:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1623379178, now seen corresponding path program 2 times [2022-09-20 22:25:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134730626] [2022-09-20 22:25:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:25:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:25:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:25:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134730626] [2022-09-20 22:25:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134730626] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:25:14,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:25:14,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-09-20 22:25:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599373028] [2022-09-20 22:25:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:25:14,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 22:25:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:25:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 22:25:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-09-20 22:25:14,980 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-09-20 22:25:14,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 205 transitions, 1171 flow. Second operand has 14 states, 14 states have (on average 106.07142857142857) internal successors, (1485), 14 states have internal predecessors, (1485), 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-09-20 22:25:14,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:25:14,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-09-20 22:25:14,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:25:16,460 INFO L130 PetriNetUnfolder]: 3354/11238 cut-off events. [2022-09-20 22:25:16,461 INFO L131 PetriNetUnfolder]: For 17189/17475 co-relation queries the response was YES. [2022-09-20 22:25:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31676 conditions, 11238 events. 3354/11238 cut-off events. For 17189/17475 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 147995 event pairs, 74 based on Foata normal form. 3/10644 useless extension candidates. Maximal degree in co-relation 31642. Up to 1242 conditions per place. [2022-09-20 22:25:16,560 INFO L137 encePairwiseOnDemand]: 126/138 looper letters, 41 selfloop transitions, 10 changer transitions 5/230 dead transitions. [2022-09-20 22:25:16,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 230 transitions, 1388 flow [2022-09-20 22:25:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:25:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:25:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1404 transitions. [2022-09-20 22:25:16,562 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-09-20 22:25:16,562 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1404 transitions. [2022-09-20 22:25:16,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1404 transitions. [2022-09-20 22:25:16,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:25:16,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1404 transitions. [2022-09-20 22:25:16,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 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-09-20 22:25:16,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:25:16,565 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-09-20 22:25:16,565 INFO L175 Difference]: Start difference. First operand has 194 places, 205 transitions, 1171 flow. Second operand 13 states and 1404 transitions. [2022-09-20 22:25:16,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 230 transitions, 1388 flow [2022-09-20 22:25:17,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 230 transitions, 1335 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-09-20 22:25:17,417 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 1194 flow [2022-09-20 22:25:17,417 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1194, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2022-09-20 22:25:17,417 INFO L287 CegarLoopForPetriNet]: 145 programPoint places, 58 predicate places. [2022-09-20 22:25:17,418 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 1194 flow [2022-09-20 22:25:17,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 106.07142857142857) internal successors, (1485), 14 states have internal predecessors, (1485), 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-09-20 22:25:17,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:25:17,419 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:25:17,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:25:17,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:25:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:25:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -64437500, now seen corresponding path program 3 times [2022-09-20 22:25:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:25:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100900376] [2022-09-20 22:25:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:25:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:25:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:25:17,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:25:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:25:17,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:25:17,554 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:25:17,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 22:25:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 22:25:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 22:25:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 22:25:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 22:25:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 22:25:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 22:25:17,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:25:17,556 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:25:17,560 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:25:17,560 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:25:17,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:25:17 BasicIcfg [2022-09-20 22:25:17,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:25:17,716 INFO L158 Benchmark]: Toolchain (without parser) took 56856.15ms. Allocated memory was 189.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 137.2MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-20 22:25:17,717 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:25:17,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.85ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 151.9MB in the end (delta: -15.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-09-20 22:25:17,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.01ms. Allocated memory is still 189.8MB. Free memory was 151.6MB in the beginning and 149.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:25:17,717 INFO L158 Benchmark]: Boogie Preprocessor took 51.77ms. Allocated memory is still 189.8MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 22:25:17,717 INFO L158 Benchmark]: RCFGBuilder took 883.56ms. Allocated memory is still 189.8MB. Free memory was 146.7MB in the beginning and 112.8MB in the end (delta: 33.9MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2022-09-20 22:25:17,718 INFO L158 Benchmark]: TraceAbstraction took 55386.76ms. Allocated memory was 189.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 112.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-09-20 22:25:17,719 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.12ms. Allocated memory is still 189.8MB. Free memory was 155.3MB in the beginning and 155.2MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.85ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 151.9MB in the end (delta: -15.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.01ms. Allocated memory is still 189.8MB. Free memory was 151.6MB in the beginning and 149.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.77ms. Allocated memory is still 189.8MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 883.56ms. Allocated memory is still 189.8MB. Free memory was 146.7MB in the beginning and 112.8MB in the end (delta: 33.9MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. * TraceAbstraction took 55386.76ms. Allocated memory was 189.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 112.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.1GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L722] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L723] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L724] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L725] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L726] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L727] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L733] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L734] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L735] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L736] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L737] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L738] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L742] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t465; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-3, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=-2, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=-1, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t468; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=2, y=1, z=1] [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - 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: 873]: 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: 867]: 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: 871]: 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: 869]: 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 9 procedures, 175 locations, 7 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: 55.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 53.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1033 mSDsluCounter, 725 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2016 IncrementalHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 162 mSDtfsCounter, 2016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1294occurred in iteration=8, InterpolantAutomatonStates: 126, 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.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 4891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-09-20 22:25:17,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...