/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:30:55,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:55,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:55,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:55,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:55,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:55,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:55,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:55,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:55,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:55,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:55,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:55,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:55,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:55,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:55,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:55,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:55,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:55,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:55,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:55,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:55,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:55,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:55,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:55,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:55,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:55,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:55,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:55,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:55,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:55,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:55,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:55,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:55,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:55,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:55,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:55,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:55,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:55,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:55,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:55,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:55,074 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:30:55,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:55,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:55,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:55,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:55,098 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:55,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:55,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:55,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:55,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:55,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:55,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:30:55,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:55,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:30:55,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:55,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:55,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:30:55,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:30:55,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:55,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:55,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:55,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:55,388 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:55,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2022-12-13 09:30:56,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:56,604 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:56,605 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2022-12-13 09:30:56,630 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3026d28/be00869538684e02ac20195eb18f02c2/FLAG460420612 [2022-12-13 09:30:56,640 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3026d28/be00869538684e02ac20195eb18f02c2 [2022-12-13 09:30:56,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:56,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:30:56,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:56,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:56,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:56,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:56" (1/1) ... [2022-12-13 09:30:56,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ddc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:56, skipping insertion in model container [2022-12-13 09:30:56,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:56" (1/1) ... [2022-12-13 09:30:56,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:56,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:56,817 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i[987,1000] [2022-12-13 09:30:56,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:56,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:56,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:57,006 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:57,015 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i[987,1000] [2022-12-13 09:30:57,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:57,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:57,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:57,090 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:57,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57 WrapperNode [2022-12-13 09:30:57,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:57,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:57,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:57,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:57,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,147 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-13 09:30:57,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:57,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:57,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:57,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:57,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:57,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:57,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:57,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:57,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (1/1) ... [2022-12-13 09:30:57,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:30:57,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:57,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:30:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:30:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:30:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:30:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:30:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:30:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:57,257 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:30:57,364 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:30:57,365 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:57,604 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:30:57,717 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:57,718 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:30:57,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:57 BoogieIcfgContainer [2022-12-13 09:30:57,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:57,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:57,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:57,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:56" (1/3) ... [2022-12-13 09:30:57,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5db42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:57, skipping insertion in model container [2022-12-13 09:30:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:57" (2/3) ... [2022-12-13 09:30:57,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5db42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:57, skipping insertion in model container [2022-12-13 09:30:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:57" (3/3) ... [2022-12-13 09:30:57,725 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-12-13 09:30:57,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:57,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:30:57,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:57,797 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:57,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 09:30:57,869 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 09:30:57,869 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:57,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:30:57,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 09:30:57,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-13 09:30:57,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:57,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 09:30:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-13 09:30:57,934 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 09:30:57,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:57,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:30:57,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 09:30:57,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 09:31:01,177 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 09:31:01,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:31:01,194 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38fa14f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:31:01,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:31:01,197 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 09:31:01,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:01,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:01,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:31:01,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash 425556467, now seen corresponding path program 1 times [2022-12-13 09:31:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:01,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393177560] [2022-12-13 09:31:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393177560] [2022-12-13 09:31:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393177560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:01,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:01,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493087573] [2022-12-13 09:31:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:01,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:01,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2022-12-13 09:31:01,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:01,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2022-12-13 09:31:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:01,782 INFO L130 PetriNetUnfolder]: 1106/2051 cut-off events. [2022-12-13 09:31:01,782 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:31:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 2051 events. 1106/2051 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13439 event pairs, 96 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 3864. Up to 1586 conditions per place. [2022-12-13 09:31:01,789 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 38/69 dead transitions. [2022-12-13 09:31:01,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 266 flow [2022-12-13 09:31:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 09:31:01,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2022-12-13 09:31:01,798 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 96 flow. Second operand 3 states and 88 transitions. [2022-12-13 09:31:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 266 flow [2022-12-13 09:31:01,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:01,802 INFO L231 Difference]: Finished difference. Result has 50 places, 24 transitions, 56 flow [2022-12-13 09:31:01,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=50, PETRI_TRANSITIONS=24} [2022-12-13 09:31:01,805 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 09:31:01,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:01,806 INFO L89 Accepts]: Start accepts. Operand has 50 places, 24 transitions, 56 flow [2022-12-13 09:31:01,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:01,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:01,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 24 transitions, 56 flow [2022-12-13 09:31:01,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2022-12-13 09:31:01,812 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:31:01,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:01,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:31:01,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 56 flow [2022-12-13 09:31:01,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 09:31:01,913 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:01,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 09:31:01,915 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2022-12-13 09:31:01,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:01,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:01,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:31:01,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 937903169, now seen corresponding path program 1 times [2022-12-13 09:31:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:01,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139169261] [2022-12-13 09:31:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139169261] [2022-12-13 09:31:02,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139169261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547407217] [2022-12-13 09:31:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:02,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:31:02,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:31:02,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,157 INFO L130 PetriNetUnfolder]: 316/574 cut-off events. [2022-12-13 09:31:02,157 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 09:31:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 574 events. 316/574 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2458 event pairs, 124 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 1145. Up to 500 conditions per place. [2022-12-13 09:31:02,160 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 23 selfloop transitions, 3 changer transitions 2/33 dead transitions. [2022-12-13 09:31:02,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 134 flow [2022-12-13 09:31:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 09:31:02,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 09:31:02,161 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 44 transitions. [2022-12-13 09:31:02,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 134 flow [2022-12-13 09:31:02,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:02,162 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 69 flow [2022-12-13 09:31:02,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-13 09:31:02,163 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2022-12-13 09:31:02,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:02,163 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 69 flow [2022-12-13 09:31:02,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:02,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:02,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 69 flow [2022-12-13 09:31:02,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 69 flow [2022-12-13 09:31:02,167 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-13 09:31:02,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:02,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2022-12-13 09:31:02,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 69 flow [2022-12-13 09:31:02,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 09:31:02,189 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:02,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 09:31:02,190 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 69 flow [2022-12-13 09:31:02,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:02,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:02,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:31:02,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -569016963, now seen corresponding path program 1 times [2022-12-13 09:31:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:02,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410930973] [2022-12-13 09:31:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410930973] [2022-12-13 09:31:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410930973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899518767] [2022-12-13 09:31:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:02,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:31:02,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:31:02,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,385 INFO L130 PetriNetUnfolder]: 231/429 cut-off events. [2022-12-13 09:31:02,385 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 09:31:02,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 429 events. 231/429 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1700 event pairs, 71 based on Foata normal form. 8/385 useless extension candidates. Maximal degree in co-relation 927. Up to 305 conditions per place. [2022-12-13 09:31:02,387 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 09:31:02,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 133 flow [2022-12-13 09:31:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 09:31:02,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2022-12-13 09:31:02,388 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 69 flow. Second operand 3 states and 41 transitions. [2022-12-13 09:31:02,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 133 flow [2022-12-13 09:31:02,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:31:02,389 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 09:31:02,390 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -19 predicate places. [2022-12-13 09:31:02,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:02,390 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:02,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:02,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,394 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-12-13 09:31:02,394 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 09:31:02,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 32 events. 2/32 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 45. Up to 8 conditions per place. [2022-12-13 09:31:02,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 09:31:02,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:02,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 09:31:02,397 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 77 flow [2022-12-13 09:31:02,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:02,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:02,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:31:02,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash -634586706, now seen corresponding path program 1 times [2022-12-13 09:31:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:02,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412164848] [2022-12-13 09:31:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412164848] [2022-12-13 09:31:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412164848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338659125] [2022-12-13 09:31:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:02,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2022-12-13 09:31:02,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2022-12-13 09:31:02,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,551 INFO L130 PetriNetUnfolder]: 179/361 cut-off events. [2022-12-13 09:31:02,551 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-13 09:31:02,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 361 events. 179/361 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1512 event pairs, 99 based on Foata normal form. 8/321 useless extension candidates. Maximal degree in co-relation 791. Up to 237 conditions per place. [2022-12-13 09:31:02,553 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 24 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-13 09:31:02,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 149 flow [2022-12-13 09:31:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 09:31:02,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2022-12-13 09:31:02,554 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 77 flow. Second operand 3 states and 45 transitions. [2022-12-13 09:31:02,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 149 flow [2022-12-13 09:31:02,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:02,556 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-13 09:31:02,556 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -18 predicate places. [2022-12-13 09:31:02,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:02,556 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:02,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:02,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,560 INFO L130 PetriNetUnfolder]: 1/30 cut-off events. [2022-12-13 09:31:02,561 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-13 09:31:02,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 1/30 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 09:31:02,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 09:31:02,562 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:02,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 09:31:02,563 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 82 flow [2022-12-13 09:31:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:02,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:02,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:31:02,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1870128736, now seen corresponding path program 1 times [2022-12-13 09:31:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:02,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643294948] [2022-12-13 09:31:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643294948] [2022-12-13 09:31:02,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643294948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568832839] [2022-12-13 09:31:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:02,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:31:02,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:31:02,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,720 INFO L130 PetriNetUnfolder]: 131/291 cut-off events. [2022-12-13 09:31:02,721 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 09:31:02,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 291 events. 131/291 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1247 event pairs, 37 based on Foata normal form. 14/234 useless extension candidates. Maximal degree in co-relation 674. Up to 247 conditions per place. [2022-12-13 09:31:02,722 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 25 selfloop transitions, 7 changer transitions 1/38 dead transitions. [2022-12-13 09:31:02,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 177 flow [2022-12-13 09:31:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 09:31:02,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2022-12-13 09:31:02,723 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 82 flow. Second operand 3 states and 47 transitions. [2022-12-13 09:31:02,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 177 flow [2022-12-13 09:31:02,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:02,725 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 121 flow [2022-12-13 09:31:02,725 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-13 09:31:02,725 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2022-12-13 09:31:02,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:02,726 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 121 flow [2022-12-13 09:31:02,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:02,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:02,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 121 flow [2022-12-13 09:31:02,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 121 flow [2022-12-13 09:31:02,735 INFO L130 PetriNetUnfolder]: 28/113 cut-off events. [2022-12-13 09:31:02,735 INFO L131 PetriNetUnfolder]: For 51/54 co-relation queries the response was YES. [2022-12-13 09:31:02,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 113 events. 28/113 cut-off events. For 51/54 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 518 event pairs, 9 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 238. Up to 64 conditions per place. [2022-12-13 09:31:02,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 30 transitions, 121 flow [2022-12-13 09:31:02,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-13 09:31:02,737 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:02,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 09:31:02,738 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 121 flow [2022-12-13 09:31:02,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:02,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:02,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:31:02,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash -189471713, now seen corresponding path program 1 times [2022-12-13 09:31:02,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417694816] [2022-12-13 09:31:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417694816] [2022-12-13 09:31:02,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417694816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913006350] [2022-12-13 09:31:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:02,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:31:02,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:31:02,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:02,992 INFO L130 PetriNetUnfolder]: 41/140 cut-off events. [2022-12-13 09:31:02,992 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 09:31:02,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 140 events. 41/140 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 548 event pairs, 10 based on Foata normal form. 24/129 useless extension candidates. Maximal degree in co-relation 409. Up to 58 conditions per place. [2022-12-13 09:31:02,993 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 19 selfloop transitions, 13 changer transitions 0/37 dead transitions. [2022-12-13 09:31:02,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 204 flow [2022-12-13 09:31:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 09:31:02,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-13 09:31:02,995 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 121 flow. Second operand 4 states and 48 transitions. [2022-12-13 09:31:02,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 204 flow [2022-12-13 09:31:02,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 184 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:02,998 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 142 flow [2022-12-13 09:31:02,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-13 09:31:03,000 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2022-12-13 09:31:03,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:03,001 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 142 flow [2022-12-13 09:31:03,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:03,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:03,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 142 flow [2022-12-13 09:31:03,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 142 flow [2022-12-13 09:31:03,010 INFO L130 PetriNetUnfolder]: 10/71 cut-off events. [2022-12-13 09:31:03,010 INFO L131 PetriNetUnfolder]: For 12/18 co-relation queries the response was YES. [2022-12-13 09:31:03,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 71 events. 10/71 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 253 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 165. Up to 37 conditions per place. [2022-12-13 09:31:03,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 142 flow [2022-12-13 09:31:03,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 09:31:03,477 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:03,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 476 [2022-12-13 09:31:03,477 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 138 flow [2022-12-13 09:31:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:03,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:03,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:31:03,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1617922826, now seen corresponding path program 1 times [2022-12-13 09:31:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:03,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849619304] [2022-12-13 09:31:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849619304] [2022-12-13 09:31:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849619304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:03,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:03,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120177928] [2022-12-13 09:31:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:03,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2022-12-13 09:31:03,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:03,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:03,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2022-12-13 09:31:03,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:03,682 INFO L130 PetriNetUnfolder]: 61/167 cut-off events. [2022-12-13 09:31:03,682 INFO L131 PetriNetUnfolder]: For 137/147 co-relation queries the response was YES. [2022-12-13 09:31:03,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 167 events. 61/167 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 687 event pairs, 3 based on Foata normal form. 19/158 useless extension candidates. Maximal degree in co-relation 547. Up to 93 conditions per place. [2022-12-13 09:31:03,683 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 22 selfloop transitions, 1 changer transitions 19/47 dead transitions. [2022-12-13 09:31:03,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 314 flow [2022-12-13 09:31:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 09:31:03,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 09:31:03,686 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 138 flow. Second operand 4 states and 48 transitions. [2022-12-13 09:31:03,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 314 flow [2022-12-13 09:31:03,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 270 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:03,687 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 109 flow [2022-12-13 09:31:03,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-13 09:31:03,688 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2022-12-13 09:31:03,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:03,688 INFO L89 Accepts]: Start accepts. Operand has 36 places, 25 transitions, 109 flow [2022-12-13 09:31:03,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:03,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:03,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 109 flow [2022-12-13 09:31:03,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 109 flow [2022-12-13 09:31:03,694 INFO L130 PetriNetUnfolder]: 9/51 cut-off events. [2022-12-13 09:31:03,694 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 09:31:03,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 51 events. 9/51 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 177 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 120. Up to 28 conditions per place. [2022-12-13 09:31:03,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 109 flow [2022-12-13 09:31:03,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 09:31:04,656 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:31:04,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 969 [2022-12-13 09:31:04,657 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 101 flow [2022-12-13 09:31:04,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:04,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:04,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:31:04,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1674325671, now seen corresponding path program 1 times [2022-12-13 09:31:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690296788] [2022-12-13 09:31:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690296788] [2022-12-13 09:31:05,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690296788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:05,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:05,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631335500] [2022-12-13 09:31:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:05,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2022-12-13 09:31:05,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:05,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:05,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2022-12-13 09:31:05,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:05,225 INFO L130 PetriNetUnfolder]: 22/75 cut-off events. [2022-12-13 09:31:05,225 INFO L131 PetriNetUnfolder]: For 110/112 co-relation queries the response was YES. [2022-12-13 09:31:05,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 75 events. 22/75 cut-off events. For 110/112 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 334 event pairs, 0 based on Foata normal form. 11/68 useless extension candidates. Maximal degree in co-relation 236. Up to 46 conditions per place. [2022-12-13 09:31:05,225 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 14 selfloop transitions, 4 changer transitions 9/32 dead transitions. [2022-12-13 09:31:05,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 214 flow [2022-12-13 09:31:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 09:31:05,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 09:31:05,228 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 101 flow. Second operand 6 states and 38 transitions. [2022-12-13 09:31:05,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 214 flow [2022-12-13 09:31:05,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 206 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:05,230 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 106 flow [2022-12-13 09:31:05,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-13 09:31:05,232 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -19 predicate places. [2022-12-13 09:31:05,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:05,232 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 106 flow [2022-12-13 09:31:05,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:05,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:05,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 106 flow [2022-12-13 09:31:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 106 flow [2022-12-13 09:31:05,237 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-13 09:31:05,237 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 09:31:05,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 45 events. 9/45 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 170 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 124. Up to 28 conditions per place. [2022-12-13 09:31:05,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 106 flow [2022-12-13 09:31:05,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 09:31:05,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L802-->L812: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_387 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_187 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_215 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_388 256) 0)) .cse5)) (.cse0 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_346 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_345 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_346)) (= (+ v_~__unbuffered_cnt~0_308 1) v_~__unbuffered_cnt~0_307) (= v_~y$w_buff0_used~0_387 (ite .cse2 0 v_~y$w_buff0_used~0_388)) (= v_~y~0_307 (ite .cse2 v_~y$w_buff0~0_272 (ite .cse0 v_~y$w_buff1~0_243 v_~y~0_308))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_214 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_345 256) 0)))) 0 v_~y$r_buff1_thd2~0_187) v_~y$r_buff1_thd2~0_186) (= v_~y$r_buff0_thd2~0_214 (ite .cse1 0 v_~y$r_buff0_thd2~0_215))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_187, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_388, ~y$w_buff1~0=v_~y$w_buff1~0_243, ~y$w_buff0~0=v_~y$w_buff0~0_272, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_215, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_308, ~y~0=v_~y~0_308, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_346} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_387, ~y$w_buff1~0=v_~y$w_buff1~0_243, ~y$w_buff0~0=v_~y$w_buff0~0_272, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_214, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_307, ~y~0=v_~y~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_345} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] and [433] L829-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_357 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_119 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_318 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_358 256) 0)) .cse5))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_129 1) (= v_~__unbuffered_p1_EAX~0_132 1) (= v_~__unbuffered_p0_EBX~0_136 0) (= v_~__unbuffered_p1_EBX~0_120 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_120) (= v_~y~0_279 (ite .cse0 v_~y$w_buff0~0_248 (ite .cse1 v_~y$w_buff1~0_221 v_~y~0_280))) (= v_~y$r_buff0_thd0~0_118 (ite .cse2 0 v_~y$r_buff0_thd0~0_119)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_118 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_317 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_122) v_~y$r_buff1_thd0~0_121) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_318) v_~y$w_buff1_used~0_317) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= v_~main$tmp_guard0~0_72 (ite (= (ite (= v_~__unbuffered_cnt~0_305 2) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| 0) (= (ite .cse0 0 v_~y$w_buff0_used~0_358) v_~y$w_buff0_used~0_357) (= (mod v_~main$tmp_guard1~0_120 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_119, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_280, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_318} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_121|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_85|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_120, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_279, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:31:06,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L802-->P1FINAL: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_191 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_219 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_391 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_350 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_392 256) 0))))) (and (= v_~y~0_311 (ite .cse0 v_~y$w_buff0~0_274 (ite .cse1 v_~y$w_buff1~0_245 v_~y~0_312))) (= |v_P1Thread1of1ForFork0_#res#1.offset_55| 0) (= v_~__unbuffered_cnt~0_311 (+ v_~__unbuffered_cnt~0_312 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_55| 0) (= v_~y$r_buff0_thd2~0_218 (ite .cse2 0 v_~y$r_buff0_thd2~0_219)) (= v_~y$w_buff1_used~0_349 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_350)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_349 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd2~0_218 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_191) v_~y$r_buff1_thd2~0_190) (= (ite .cse0 0 v_~y$w_buff0_used~0_392) v_~y$w_buff0_used~0_391)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_392, ~y$w_buff1~0=v_~y$w_buff1~0_245, ~y$w_buff0~0=v_~y$w_buff0~0_274, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_312, ~y~0=v_~y~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_190, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_391, ~y$w_buff1~0=v_~y$w_buff1~0_245, ~y$w_buff0~0=v_~y$w_buff0~0_274, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_218, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_311, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_55|, ~y~0=v_~y~0_311, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_55|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_349} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~y~0, P1Thread1of1ForFork0_#res#1.offset, ~y$w_buff1_used~0] and [433] L829-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_357 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_119 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_318 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_358 256) 0)) .cse5))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_129 1) (= v_~__unbuffered_p1_EAX~0_132 1) (= v_~__unbuffered_p0_EBX~0_136 0) (= v_~__unbuffered_p1_EBX~0_120 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_120) (= v_~y~0_279 (ite .cse0 v_~y$w_buff0~0_248 (ite .cse1 v_~y$w_buff1~0_221 v_~y~0_280))) (= v_~y$r_buff0_thd0~0_118 (ite .cse2 0 v_~y$r_buff0_thd0~0_119)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_118 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_317 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_122) v_~y$r_buff1_thd0~0_121) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_318) v_~y$w_buff1_used~0_317) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= v_~main$tmp_guard0~0_72 (ite (= (ite (= v_~__unbuffered_cnt~0_305 2) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| 0) (= (ite .cse0 0 v_~y$w_buff0_used~0_358) v_~y$w_buff0_used~0_357) (= (mod v_~main$tmp_guard1~0_120 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_119, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_280, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_318} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_121|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_85|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_120, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_279, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:31:06,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [440] L802-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_395 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_195 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_223 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_396 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_354 256) 0)) .cse2)) (.cse0 (and .cse3 .cse5))) (and (= |v_P1Thread1of1ForFork0_#res#1.base_57| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_57| 0) (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_354) v_~y$w_buff1_used~0_353) (= v_~y$r_buff1_thd2~0_194 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_353 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_222 256) 0)))) 0 v_~y$r_buff1_thd2~0_195)) (= v_~y$w_buff0_used~0_395 (ite .cse4 0 v_~y$w_buff0_used~0_396)) (= v_~__unbuffered_cnt~0_315 (+ v_~__unbuffered_cnt~0_316 1)) (= v_~y~0_315 (ite .cse4 v_~y$w_buff0~0_276 (ite .cse1 v_~y$w_buff1~0_247 v_~y~0_316))) (= (ite .cse0 0 v_~y$r_buff0_thd2~0_223) v_~y$r_buff0_thd2~0_222)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_195, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_396, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_276, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_223, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_316, ~y~0=v_~y~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_354} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_194, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_395, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_276, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_222, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_315, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_57|, ~y~0=v_~y~0_315, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_57|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_353} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~y~0, P1Thread1of1ForFork0_#res#1.offset, ~y$w_buff1_used~0] and [433] L829-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_122 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_357 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_119 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_318 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_358 256) 0)) .cse5))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_129 1) (= v_~__unbuffered_p1_EAX~0_132 1) (= v_~__unbuffered_p0_EBX~0_136 0) (= v_~__unbuffered_p1_EBX~0_120 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_120) (= v_~y~0_279 (ite .cse0 v_~y$w_buff0~0_248 (ite .cse1 v_~y$w_buff1~0_221 v_~y~0_280))) (= v_~y$r_buff0_thd0~0_118 (ite .cse2 0 v_~y$r_buff0_thd0~0_119)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_118 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_317 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_122) v_~y$r_buff1_thd0~0_121) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_318) v_~y$w_buff1_used~0_317) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= v_~main$tmp_guard0~0_72 (ite (= (ite (= v_~__unbuffered_cnt~0_305 2) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_121| 0) (= (ite .cse0 0 v_~y$w_buff0_used~0_358) v_~y$w_buff0_used~0_357) (= (mod v_~main$tmp_guard1~0_120 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_119, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_280, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_122, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_318} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_121|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_120, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_85|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_120, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_129, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_248, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, ~y~0=v_~y~0_279, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:31:07,384 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:07,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2154 [2022-12-13 09:31:07,386 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 152 flow [2022-12-13 09:31:07,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:07,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:07,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:07,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:31:07,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:31:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -604531593, now seen corresponding path program 1 times [2022-12-13 09:31:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62301071] [2022-12-13 09:31:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:07,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:31:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:07,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:31:07,448 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:31:07,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:31:07,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:31:07,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:31:07,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:31:07,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:31:07,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:31:07,450 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:07,455 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:31:07,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:31:07,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:31:07 BasicIcfg [2022-12-13 09:31:07,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:31:07,485 INFO L158 Benchmark]: Toolchain (without parser) took 10842.26ms. Allocated memory was 201.3MB in the beginning and 373.3MB in the end (delta: 172.0MB). Free memory was 176.2MB in the beginning and 236.3MB in the end (delta: -60.0MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,485 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:31:07,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.13ms. Allocated memory is still 201.3MB. Free memory was 176.2MB in the beginning and 150.3MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.02ms. Allocated memory is still 201.3MB. Free memory was 150.3MB in the beginning and 147.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,486 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 201.3MB. Free memory was 147.1MB in the beginning and 145.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,486 INFO L158 Benchmark]: RCFGBuilder took 537.73ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 110.4MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,486 INFO L158 Benchmark]: TraceAbstraction took 9763.69ms. Allocated memory was 201.3MB in the beginning and 373.3MB in the end (delta: 172.0MB). Free memory was 109.4MB in the beginning and 236.3MB in the end (delta: -126.9MB). Peak memory consumption was 45.6MB. Max. memory is 8.0GB. [2022-12-13 09:31:07,487 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.16ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.13ms. Allocated memory is still 201.3MB. Free memory was 176.2MB in the beginning and 150.3MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.02ms. Allocated memory is still 201.3MB. Free memory was 150.3MB in the beginning and 147.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 201.3MB. Free memory was 147.1MB in the beginning and 145.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 537.73ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 110.4MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9763.69ms. Allocated memory was 201.3MB in the beginning and 373.3MB in the end (delta: 172.0MB). Free memory was 109.4MB in the beginning and 236.3MB in the end (delta: -126.9MB). Peak memory consumption was 45.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 94 PlacesBefore, 52 PlacesAfterwards, 89 TransitionsBefore, 45 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 74 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1842, independent: 1701, independent conditional: 1701, independent unconditional: 0, dependent: 141, dependent conditional: 141, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1147, independent: 1101, independent conditional: 0, independent unconditional: 1101, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1147, independent: 1101, independent conditional: 0, independent unconditional: 1101, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1147, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1842, independent: 600, independent conditional: 600, independent unconditional: 0, dependent: 95, dependent conditional: 95, dependent unconditional: 0, unknown: 1147, unknown conditional: 1147, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1102, Positive conditional cache size: 1102, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 117, independent conditional: 7, independent unconditional: 110, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 135, independent: 117, independent conditional: 7, independent unconditional: 110, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 135, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 78, dependent conditional: 6, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 135, unknown conditional: 135, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 6, independent unconditional: 35, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 6, independent unconditional: 35, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 158, Positive conditional cache size: 158, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 11, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 184, Positive conditional cache size: 184, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 187, Positive conditional cache size: 187, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 35 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 190, Positive conditional cache size: 190, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 34 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 18, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 18, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 226, Positive conditional cache size: 226, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-1, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 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) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 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 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 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 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 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 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 6 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:31:07,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...