/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:45:08,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:45:08,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:45:08,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:45:08,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:45:08,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:45:08,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:45:08,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:45:08,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:45:08,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:45:08,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:45:08,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:45:08,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:45:08,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:45:08,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:45:08,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:45:08,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:45:08,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:45:08,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:45:08,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:45:08,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:45:08,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:45:08,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:45:08,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:45:08,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:45:08,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:45:08,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:45:08,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:45:08,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:45:08,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:45:08,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:45:08,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:45:08,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:45:08,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:45:08,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:45:08,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:45:08,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:45:08,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:45:08,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:45:08,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:45:08,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:45:08,304 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-VariableLbe.epf [2023-01-28 00:45:08,331 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:45:08,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:45:08,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:45:08,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:45:08,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:45:08,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:45:08,334 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:45:08,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:45:08,334 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:45:08,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:45:08,335 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:45:08,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:08,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:45:08,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:45:08,337 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:45:08,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:45:08,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:45:08,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:45:08,596 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:45:08,596 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:45:08,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-01-28 00:45:09,746 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:45:10,018 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:45:10,019 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-01-28 00:45:10,032 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c1ac406/ba707676ded643519250ca9409ec7761/FLAGd5085f5e4 [2023-01-28 00:45:10,047 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c1ac406/ba707676ded643519250ca9409ec7761 [2023-01-28 00:45:10,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:45:10,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:45:10,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:10,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:45:10,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:45:10,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c5c0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10, skipping insertion in model container [2023-01-28 00:45:10,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:45:10,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:45:10,306 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i[995,1008] [2023-01-28 00:45:10,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:10,575 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:45:10,585 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i[995,1008] [2023-01-28 00:45:10,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:10,696 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:10,696 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:10,702 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:45:10,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10 WrapperNode [2023-01-28 00:45:10,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:10,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:10,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:45:10,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:45:10,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,763 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-01-28 00:45:10,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:10,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:45:10,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:45:10,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:45:10,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:45:10,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:45:10,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:45:10,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:45:10,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (1/1) ... [2023-01-28 00:45:10,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:45:10,827 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) [2023-01-28 00:45:10,867 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 [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:45:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:45:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:45:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:45:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:45:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:45:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:45:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:45:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:45:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:45:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:45:10,887 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:45:11,056 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:45:11,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:45:11,599 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:45:11,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:45:11,890 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:45:11,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:11 BoogieIcfgContainer [2023-01-28 00:45:11,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:45:11,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:45:11,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:45:11,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:45:11,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:45:10" (1/3) ... [2023-01-28 00:45:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:11, skipping insertion in model container [2023-01-28 00:45:11,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:10" (2/3) ... [2023-01-28 00:45:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:11, skipping insertion in model container [2023-01-28 00:45:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:11" (3/3) ... [2023-01-28 00:45:11,900 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2023-01-28 00:45:11,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:45:11,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 00:45:11,916 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:45:11,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:45:12,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 00:45:12,069 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 00:45:12,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 00:45:12,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 00:45:12,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:12,083 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:45:12,091 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:12,093 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:12,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:12,132 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-01-28 00:45:12,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-01-28 00:45:12,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-01-28 00:45:20,593 INFO L134 LiptonReduction]: Checked pairs total: 3151 [2023-01-28 00:45:20,593 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-01-28 00:45:20,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:45:20,609 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;@19f90d19, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:45:20,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 00:45:20,618 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-01-28 00:45:20,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:20,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:20,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:20,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:20,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -86757538, now seen corresponding path program 1 times [2023-01-28 00:45:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682139480] [2023-01-28 00:45:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682139480] [2023-01-28 00:45:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682139480] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:21,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:45:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863715083] [2023-01-28 00:45:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:21,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:45:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:45:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:45:21,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 218 [2023-01-28 00:45:21,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-01-28 00:45:21,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:21,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 218 [2023-01-28 00:45:21,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:21,635 INFO L130 PetriNetUnfolder]: 378/632 cut-off events. [2023-01-28 00:45:21,635 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-01-28 00:45:21,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 632 events. 378/632 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2787 event pairs, 102 based on Foata normal form. 12/640 useless extension candidates. Maximal degree in co-relation 1247. Up to 445 conditions per place. [2023-01-28 00:45:21,642 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 22 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-01-28 00:45:21,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 111 flow [2023-01-28 00:45:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:45:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:45:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-01-28 00:45:21,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5519877675840978 [2023-01-28 00:45:21,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-01-28 00:45:21,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-01-28 00:45:21,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:21,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-01-28 00:45:21,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-01-28 00:45:21,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-01-28 00:45:21,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-01-28 00:45:21,670 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 49 flow. Second operand 3 states and 361 transitions. [2023-01-28 00:45:21,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 111 flow [2023-01-28 00:45:21,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:21,674 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2023-01-28 00:45:21,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 00:45:21,678 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-01-28 00:45:21,678 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2023-01-28 00:45:21,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-01-28 00:45:21,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:21,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:21,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:45:21,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:21,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1605482883, now seen corresponding path program 1 times [2023-01-28 00:45:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:21,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565807865] [2023-01-28 00:45:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565807865] [2023-01-28 00:45:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565807865] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:22,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:45:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868671623] [2023-01-28 00:45:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:22,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:45:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:45:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:45:22,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 218 [2023-01-28 00:45:22,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-01-28 00:45:22,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:22,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 218 [2023-01-28 00:45:22,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:22,268 INFO L130 PetriNetUnfolder]: 357/590 cut-off events. [2023-01-28 00:45:22,268 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-01-28 00:45:22,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 590 events. 357/590 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2495 event pairs, 120 based on Foata normal form. 9/595 useless extension candidates. Maximal degree in co-relation 1274. Up to 463 conditions per place. [2023-01-28 00:45:22,275 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-01-28 00:45:22,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 129 flow [2023-01-28 00:45:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:45:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:45:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-01-28 00:45:22,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504587155963303 [2023-01-28 00:45:22,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-01-28 00:45:22,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-01-28 00:45:22,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:22,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-01-28 00:45:22,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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) [2023-01-28 00:45:22,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-01-28 00:45:22,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-01-28 00:45:22,287 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 360 transitions. [2023-01-28 00:45:22,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 129 flow [2023-01-28 00:45:22,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:22,288 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2023-01-28 00:45:22,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-01-28 00:45:22,289 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-01-28 00:45:22,290 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2023-01-28 00:45:22,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-01-28 00:45:22,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:22,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:45:22,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:22,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1771080321, now seen corresponding path program 1 times [2023-01-28 00:45:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023875547] [2023-01-28 00:45:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:22,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:22,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023875547] [2023-01-28 00:45:22,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023875547] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:22,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:45:22,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113351161] [2023-01-28 00:45:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:22,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:22,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:22,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:22,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 218 [2023-01-28 00:45:22,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-28 00:45:22,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:22,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 218 [2023-01-28 00:45:22,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:22,899 INFO L130 PetriNetUnfolder]: 584/961 cut-off events. [2023-01-28 00:45:22,900 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-01-28 00:45:22,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 961 events. 584/961 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4767 event pairs, 195 based on Foata normal form. 36/985 useless extension candidates. Maximal degree in co-relation 2142. Up to 328 conditions per place. [2023-01-28 00:45:22,904 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 32 selfloop transitions, 3 changer transitions 5/42 dead transitions. [2023-01-28 00:45:22,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 193 flow [2023-01-28 00:45:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-01-28 00:45:22,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481651376146789 [2023-01-28 00:45:22,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-01-28 00:45:22,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-01-28 00:45:22,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:22,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-01-28 00:45:22,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-01-28 00:45:22,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:22,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:22,910 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 478 transitions. [2023-01-28 00:45:22,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 193 flow [2023-01-28 00:45:22,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:22,911 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2023-01-28 00:45:22,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-01-28 00:45:22,913 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-01-28 00:45:22,915 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 68 flow [2023-01-28 00:45:22,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-28 00:45:22,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:22,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:45:22,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:22,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash -316706185, now seen corresponding path program 1 times [2023-01-28 00:45:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106142138] [2023-01-28 00:45:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:24,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:24,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106142138] [2023-01-28 00:45:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106142138] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:24,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914594619] [2023-01-28 00:45:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:24,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:24,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2023-01-28 00:45:24,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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) [2023-01-28 00:45:24,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:24,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2023-01-28 00:45:24,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:24,464 INFO L130 PetriNetUnfolder]: 457/727 cut-off events. [2023-01-28 00:45:24,464 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2023-01-28 00:45:24,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 727 events. 457/727 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2817 event pairs, 337 based on Foata normal form. 16/742 useless extension candidates. Maximal degree in co-relation 1768. Up to 631 conditions per place. [2023-01-28 00:45:24,469 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2023-01-28 00:45:24,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 182 flow [2023-01-28 00:45:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2023-01-28 00:45:24,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889908256880734 [2023-01-28 00:45:24,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2023-01-28 00:45:24,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2023-01-28 00:45:24,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:24,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2023-01-28 00:45:24,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 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) [2023-01-28 00:45:24,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:24,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:24,476 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 68 flow. Second operand 5 states and 533 transitions. [2023-01-28 00:45:24,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 182 flow [2023-01-28 00:45:24,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 166 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:24,478 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 129 flow [2023-01-28 00:45:24,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-01-28 00:45:24,479 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-01-28 00:45:24,479 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 129 flow [2023-01-28 00:45:24,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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) [2023-01-28 00:45:24,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:24,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:24,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:45:24,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:24,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1249985801, now seen corresponding path program 2 times [2023-01-28 00:45:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069230223] [2023-01-28 00:45:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069230223] [2023-01-28 00:45:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069230223] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:25,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826386337] [2023-01-28 00:45:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:25,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:25,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 218 [2023-01-28 00:45:25,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 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) [2023-01-28 00:45:25,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:25,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 218 [2023-01-28 00:45:25,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:26,176 INFO L130 PetriNetUnfolder]: 452/723 cut-off events. [2023-01-28 00:45:26,176 INFO L131 PetriNetUnfolder]: For 546/546 co-relation queries the response was YES. [2023-01-28 00:45:26,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 723 events. 452/723 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2798 event pairs, 234 based on Foata normal form. 2/725 useless extension candidates. Maximal degree in co-relation 2041. Up to 598 conditions per place. [2023-01-28 00:45:26,182 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2023-01-28 00:45:26,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 223 flow [2023-01-28 00:45:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-01-28 00:45:26,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49655963302752293 [2023-01-28 00:45:26,184 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-01-28 00:45:26,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-01-28 00:45:26,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:26,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-01-28 00:45:26,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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) [2023-01-28 00:45:26,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:26,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:26,189 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 129 flow. Second operand 4 states and 433 transitions. [2023-01-28 00:45:26,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 223 flow [2023-01-28 00:45:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:45:26,193 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 178 flow [2023-01-28 00:45:26,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-01-28 00:45:26,195 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-01-28 00:45:26,195 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 178 flow [2023-01-28 00:45:26,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 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) [2023-01-28 00:45:26,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:26,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:26,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:45:26,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:26,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -84620624, now seen corresponding path program 1 times [2023-01-28 00:45:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329389009] [2023-01-28 00:45:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:26,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329389009] [2023-01-28 00:45:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329389009] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268840209] [2023-01-28 00:45:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:26,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:26,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 218 [2023-01-28 00:45:26,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-28 00:45:26,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:26,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 218 [2023-01-28 00:45:26,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:26,710 INFO L130 PetriNetUnfolder]: 288/529 cut-off events. [2023-01-28 00:45:26,711 INFO L131 PetriNetUnfolder]: For 759/808 co-relation queries the response was YES. [2023-01-28 00:45:26,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 529 events. 288/529 cut-off events. For 759/808 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2490 event pairs, 47 based on Foata normal form. 60/575 useless extension candidates. Maximal degree in co-relation 1574. Up to 324 conditions per place. [2023-01-28 00:45:26,715 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 45 selfloop transitions, 7 changer transitions 3/64 dead transitions. [2023-01-28 00:45:26,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 418 flow [2023-01-28 00:45:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-01-28 00:45:26,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302752293577981 [2023-01-28 00:45:26,718 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-01-28 00:45:26,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-01-28 00:45:26,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:26,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-01-28 00:45:26,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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) [2023-01-28 00:45:26,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:26,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:26,721 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 178 flow. Second operand 5 states and 578 transitions. [2023-01-28 00:45:26,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 418 flow [2023-01-28 00:45:26,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 393 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:26,727 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 213 flow [2023-01-28 00:45:26,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-28 00:45:26,729 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2023-01-28 00:45:26,730 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 213 flow [2023-01-28 00:45:26,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-28 00:45:26,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:26,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:26,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:45:26,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:26,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1567755212, now seen corresponding path program 1 times [2023-01-28 00:45:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809337099] [2023-01-28 00:45:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809337099] [2023-01-28 00:45:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809337099] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:27,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959788597] [2023-01-28 00:45:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:27,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:27,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 218 [2023-01-28 00:45:27,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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) [2023-01-28 00:45:27,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:27,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 218 [2023-01-28 00:45:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:27,300 INFO L130 PetriNetUnfolder]: 195/394 cut-off events. [2023-01-28 00:45:27,301 INFO L131 PetriNetUnfolder]: For 589/629 co-relation queries the response was YES. [2023-01-28 00:45:27,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 394 events. 195/394 cut-off events. For 589/629 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1838 event pairs, 14 based on Foata normal form. 39/425 useless extension candidates. Maximal degree in co-relation 1411. Up to 156 conditions per place. [2023-01-28 00:45:27,304 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 49 selfloop transitions, 13 changer transitions 8/78 dead transitions. [2023-01-28 00:45:27,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 549 flow [2023-01-28 00:45:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-01-28 00:45:27,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528178243774574 [2023-01-28 00:45:27,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-01-28 00:45:27,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-01-28 00:45:27,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:27,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-01-28 00:45:27,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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) [2023-01-28 00:45:27,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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) [2023-01-28 00:45:27,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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) [2023-01-28 00:45:27,312 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 213 flow. Second operand 7 states and 806 transitions. [2023-01-28 00:45:27,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 549 flow [2023-01-28 00:45:27,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:45:27,316 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 289 flow [2023-01-28 00:45:27,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-01-28 00:45:27,317 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-01-28 00:45:27,317 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 289 flow [2023-01-28 00:45:27,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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) [2023-01-28 00:45:27,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:27,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:27,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:45:27,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:27,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 340433289, now seen corresponding path program 1 times [2023-01-28 00:45:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233718601] [2023-01-28 00:45:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233718601] [2023-01-28 00:45:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233718601] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:28,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813777785] [2023-01-28 00:45:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:28,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:28,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:28,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 218 [2023-01-28 00:45:28,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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) [2023-01-28 00:45:28,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:28,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 218 [2023-01-28 00:45:28,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:28,320 INFO L130 PetriNetUnfolder]: 326/620 cut-off events. [2023-01-28 00:45:28,320 INFO L131 PetriNetUnfolder]: For 1957/1957 co-relation queries the response was YES. [2023-01-28 00:45:28,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 620 events. 326/620 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2861 event pairs, 70 based on Foata normal form. 8/628 useless extension candidates. Maximal degree in co-relation 2681. Up to 321 conditions per place. [2023-01-28 00:45:28,347 INFO L137 encePairwiseOnDemand]: 213/218 looper letters, 38 selfloop transitions, 3 changer transitions 30/72 dead transitions. [2023-01-28 00:45:28,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 656 flow [2023-01-28 00:45:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 401 transitions. [2023-01-28 00:45:28,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598623853211009 [2023-01-28 00:45:28,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 401 transitions. [2023-01-28 00:45:28,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 401 transitions. [2023-01-28 00:45:28,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:28,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 401 transitions. [2023-01-28 00:45:28,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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) [2023-01-28 00:45:28,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:28,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-01-28 00:45:28,354 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 289 flow. Second operand 4 states and 401 transitions. [2023-01-28 00:45:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 656 flow [2023-01-28 00:45:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 591 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:28,360 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 214 flow [2023-01-28 00:45:28,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2023-01-28 00:45:28,361 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2023-01-28 00:45:28,361 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 214 flow [2023-01-28 00:45:28,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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) [2023-01-28 00:45:28,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:28,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:28,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:45:28,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:28,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1055338651, now seen corresponding path program 1 times [2023-01-28 00:45:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485881474] [2023-01-28 00:45:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485881474] [2023-01-28 00:45:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485881474] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:29,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325529419] [2023-01-28 00:45:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:29,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:29,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2023-01-28 00:45:29,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-01-28 00:45:29,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:29,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2023-01-28 00:45:29,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:29,984 INFO L130 PetriNetUnfolder]: 121/247 cut-off events. [2023-01-28 00:45:29,984 INFO L131 PetriNetUnfolder]: For 602/602 co-relation queries the response was YES. [2023-01-28 00:45:29,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 247 events. 121/247 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 817 event pairs, 26 based on Foata normal form. 1/248 useless extension candidates. Maximal degree in co-relation 1077. Up to 182 conditions per place. [2023-01-28 00:45:29,986 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 39 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2023-01-28 00:45:29,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 450 flow [2023-01-28 00:45:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-01-28 00:45:29,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48623853211009177 [2023-01-28 00:45:29,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-01-28 00:45:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-01-28 00:45:29,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:29,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-01-28 00:45:29,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 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) [2023-01-28 00:45:29,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:29,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:29,994 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 214 flow. Second operand 5 states and 530 transitions. [2023-01-28 00:45:29,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 450 flow [2023-01-28 00:45:29,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 379 flow, removed 22 selfloop flow, removed 9 redundant places. [2023-01-28 00:45:29,997 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 260 flow [2023-01-28 00:45:29,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-01-28 00:45:29,998 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2023-01-28 00:45:29,998 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 260 flow [2023-01-28 00:45:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-01-28 00:45:29,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:29,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:29,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:45:30,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:30,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1565543195, now seen corresponding path program 2 times [2023-01-28 00:45:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058006189] [2023-01-28 00:45:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058006189] [2023-01-28 00:45:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058006189] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246330085] [2023-01-28 00:45:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:31,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2023-01-28 00:45:31,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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) [2023-01-28 00:45:31,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:31,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2023-01-28 00:45:31,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:31,466 INFO L130 PetriNetUnfolder]: 120/245 cut-off events. [2023-01-28 00:45:31,466 INFO L131 PetriNetUnfolder]: For 485/485 co-relation queries the response was YES. [2023-01-28 00:45:31,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 245 events. 120/245 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 818 event pairs, 20 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 1035. Up to 157 conditions per place. [2023-01-28 00:45:31,468 INFO L137 encePairwiseOnDemand]: 209/218 looper letters, 34 selfloop transitions, 18 changer transitions 0/53 dead transitions. [2023-01-28 00:45:31,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 438 flow [2023-01-28 00:45:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-01-28 00:45:31,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779816513761468 [2023-01-28 00:45:31,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-01-28 00:45:31,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-01-28 00:45:31,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:31,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-01-28 00:45:31,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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) [2023-01-28 00:45:31,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:31,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-01-28 00:45:31,476 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 260 flow. Second operand 5 states and 521 transitions. [2023-01-28 00:45:31,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 438 flow [2023-01-28 00:45:31,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:45:31,479 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 315 flow [2023-01-28 00:45:31,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-01-28 00:45:31,481 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-01-28 00:45:31,481 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 315 flow [2023-01-28 00:45:31,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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) [2023-01-28 00:45:31,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:31,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:31,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:45:31,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:31,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2139861618, now seen corresponding path program 1 times [2023-01-28 00:45:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305874126] [2023-01-28 00:45:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305874126] [2023-01-28 00:45:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305874126] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:45:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414500786] [2023-01-28 00:45:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:31,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:31,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 218 [2023-01-28 00:45:31,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2023-01-28 00:45:31,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:31,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 218 [2023-01-28 00:45:31,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:31,929 INFO L130 PetriNetUnfolder]: 79/179 cut-off events. [2023-01-28 00:45:31,929 INFO L131 PetriNetUnfolder]: For 461/465 co-relation queries the response was YES. [2023-01-28 00:45:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 179 events. 79/179 cut-off events. For 461/465 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 624 event pairs, 7 based on Foata normal form. 15/193 useless extension candidates. Maximal degree in co-relation 760. Up to 71 conditions per place. [2023-01-28 00:45:31,931 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 42 selfloop transitions, 11 changer transitions 6/66 dead transitions. [2023-01-28 00:45:31,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 612 flow [2023-01-28 00:45:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 787 transitions. [2023-01-28 00:45:31,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157273918741808 [2023-01-28 00:45:31,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 787 transitions. [2023-01-28 00:45:31,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 787 transitions. [2023-01-28 00:45:31,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:31,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 787 transitions. [2023-01-28 00:45:31,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 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) [2023-01-28 00:45:31,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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) [2023-01-28 00:45:31,939 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 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) [2023-01-28 00:45:31,940 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 315 flow. Second operand 7 states and 787 transitions. [2023-01-28 00:45:31,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 612 flow [2023-01-28 00:45:31,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 539 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:31,943 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 291 flow [2023-01-28 00:45:31,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-01-28 00:45:31,943 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2023-01-28 00:45:31,943 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 291 flow [2023-01-28 00:45:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2023-01-28 00:45:31,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:31,944 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] [2023-01-28 00:45:31,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:45:31,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:31,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1485106773, now seen corresponding path program 1 times [2023-01-28 00:45:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113112815] [2023-01-28 00:45:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:32,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:45:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:32,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:45:32,236 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:45:32,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 00:45:32,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 00:45:32,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 00:45:32,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 00:45:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:45:32,239 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:32,243 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:45:32,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:45:32,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:45:32 BasicIcfg [2023-01-28 00:45:32,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:45:32,329 INFO L158 Benchmark]: Toolchain (without parser) took 22277.11ms. Allocated memory was 534.8MB in the beginning and 935.3MB in the end (delta: 400.6MB). Free memory was 485.4MB in the beginning and 813.4MB in the end (delta: -328.0MB). Peak memory consumption was 74.4MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,329 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 385.9MB. Free memory was 337.7MB in the beginning and 337.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:45:32,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.78ms. Allocated memory is still 534.8MB. Free memory was 485.2MB in the beginning and 458.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.03ms. Allocated memory is still 534.8MB. Free memory was 458.9MB in the beginning and 456.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,330 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 534.8MB. Free memory was 456.1MB in the beginning and 453.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,330 INFO L158 Benchmark]: RCFGBuilder took 1093.24ms. Allocated memory is still 534.8MB. Free memory was 453.4MB in the beginning and 417.4MB in the end (delta: 35.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,331 INFO L158 Benchmark]: TraceAbstraction took 20434.08ms. Allocated memory was 534.8MB in the beginning and 935.3MB in the end (delta: 400.6MB). Free memory was 417.4MB in the beginning and 813.4MB in the end (delta: -396.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.0GB. [2023-01-28 00:45:32,332 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 385.9MB. Free memory was 337.7MB in the beginning and 337.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 647.78ms. Allocated memory is still 534.8MB. Free memory was 485.2MB in the beginning and 458.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.03ms. Allocated memory is still 534.8MB. Free memory was 458.9MB in the beginning and 456.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 534.8MB. Free memory was 456.1MB in the beginning and 453.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1093.24ms. Allocated memory is still 534.8MB. Free memory was 453.4MB in the beginning and 417.4MB in the end (delta: 35.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.0GB. * TraceAbstraction took 20434.08ms. Allocated memory was 534.8MB in the beginning and 935.3MB in the end (delta: 400.6MB). Free memory was 417.4MB in the beginning and 813.4MB in the end (delta: -396.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 119 PlacesBefore, 30 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 3151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1221, independent: 1060, independent conditional: 0, independent unconditional: 1060, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 636, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1221, independent: 465, independent conditional: 0, independent unconditional: 465, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 636, unknown conditional: 0, unknown unconditional: 636] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1777; [L854] FCALL, FORK 0 pthread_create(&t1777, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1777, ((void *)0), P0, ((void *)0))=-3, t1777={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t1778; [L856] FCALL, FORK 0 pthread_create(&t1778, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1778, ((void *)0), P1, ((void *)0))=-2, t1777={7:0}, t1778={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t1779; [L795] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t1779, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1779, ((void *)0), P2, ((void *)0))=-1, t1777={7:0}, t1778={8:0}, t1779={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] EXPR 3 \read(y) [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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, t1777={7:0}, t1778={8:0}, t1779={5:0}, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 4 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: 20.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 5 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=10, InterpolantAutomatonStates: 52, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609 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! [2023-01-28 00:45:32,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...