/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/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:24:41,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:24:41,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:24:41,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:24:41,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:24:41,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:24:41,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:24:41,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:24:41,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:24:41,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:24:41,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:24:41,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:24:41,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:24:41,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:24:41,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:24:41,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:24:41,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:24:41,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:24:41,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:24:41,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:24:41,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:24:41,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:24:41,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:24:41,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:24:41,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:24:41,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:24:41,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:24:41,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:24:41,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:24:41,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:24:41,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:24:41,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:24:41,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:24:41,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:24:41,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:24:41,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:24:41,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:24:41,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:24:41,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:24:41,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:24:41,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:24:41,851 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:24:41,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:24:41,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:24:41,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:24:41,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:24:41,885 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:24:41,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:24:41,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:24:41,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:24:41,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:24:41,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:24:41,887 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:24:41,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:24:41,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:24:41,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:24:41,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:24:41,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:24:41,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:24:41,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:24:41,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:24:41,889 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:24:42,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:24:42,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:24:42,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:24:42,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:24:42,238 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:24:42,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-13 09:24:43,292 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:24:43,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:24:43,515 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-13 09:24:43,544 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7e63c5a/0b16983afbdb4a81a9acc380685b5543/FLAG344a882bf [2022-12-13 09:24:43,564 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7e63c5a/0b16983afbdb4a81a9acc380685b5543 [2022-12-13 09:24:43,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:24:43,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:24:43,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:24:43,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:24:43,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:24:43,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:24:43" (1/1) ... [2022-12-13 09:24:43,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229211e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:43, skipping insertion in model container [2022-12-13 09:24:43,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:24:43" (1/1) ... [2022-12-13 09:24:43,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:24:43,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:24:43,790 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-13 09:24:43,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:43,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:43,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:24:43,984 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:24:43,998 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-13 09:24:44,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:44,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:44,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:24:44,102 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:24:44,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44 WrapperNode [2022-12-13 09:24:44,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:24:44,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:24:44,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:24:44,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:24:44,109 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:24:44" (1/1) ... [2022-12-13 09:24:44,122 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:24:44" (1/1) ... [2022-12-13 09:24:44,148 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-12-13 09:24:44,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:24:44,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:24:44,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:24:44,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:24:44,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,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:24:44" (1/1) ... [2022-12-13 09:24:44,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:24:44" (1/1) ... [2022-12-13 09:24:44,179 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:24:44,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:24:44,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:24:44,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:24:44,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (1/1) ... [2022-12-13 09:24:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:24:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:24:44,221 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:24:44,253 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:24:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:24:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:24:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:24:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:24:44,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:24:44,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:24:44,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:24:44,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:24:44,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:24:44,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:24:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:24:44,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:24:44,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:24:44,277 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:24:44,442 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:24:44,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:24:44,717 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:24:44,798 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:24:44,798 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:24:44,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:24:44 BoogieIcfgContainer [2022-12-13 09:24:44,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:24:44,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:24:44,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:24:44,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:24:44,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:24:43" (1/3) ... [2022-12-13 09:24:44,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf0f5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:24:44, skipping insertion in model container [2022-12-13 09:24:44,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:44" (2/3) ... [2022-12-13 09:24:44,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf0f5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:24:44, skipping insertion in model container [2022-12-13 09:24:44,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:24:44" (3/3) ... [2022-12-13 09:24:44,808 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2022-12-13 09:24:44,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:24:44,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:24:44,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:24:44,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:24:44,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 09:24:44,967 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 09:24:44,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:44,972 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 43 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:24:44,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 09:24:44,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-13 09:24:44,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:45,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 09:24:45,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-13 09:24:45,040 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 09:24:45,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:45,041 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 43 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:24:45,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 09:24:45,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-13 09:24:49,503 INFO L241 LiptonReduction]: Total number of compositions: 76 [2022-12-13 09:24:49,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:24:49,534 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;@25320350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:24:49,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:24:49,539 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 09:24:49,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:49,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:49,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:24:49,541 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:24:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 400621395, now seen corresponding path program 1 times [2022-12-13 09:24:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119109637] [2022-12-13 09:24:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:49,884 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:24:49,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:49,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119109637] [2022-12-13 09:24:49,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119109637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:49,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:49,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:24:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391677459] [2022-12-13 09:24:49,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:49,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:49,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:49,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2022-12-13 09:24:49,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:24:49,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:49,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2022-12-13 09:24:49,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:50,229 INFO L130 PetriNetUnfolder]: 1308/2368 cut-off events. [2022-12-13 09:24:50,229 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:24:50,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 2368 events. 1308/2368 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15194 event pairs, 96 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 4498. Up to 1903 conditions per place. [2022-12-13 09:24:50,244 INFO L137 encePairwiseOnDemand]: 40/46 looper letters, 21 selfloop transitions, 3 changer transitions 38/69 dead transitions. [2022-12-13 09:24:50,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 268 flow [2022-12-13 09:24:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 09:24:50,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-13 09:24:50,257 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 98 flow. Second operand 3 states and 88 transitions. [2022-12-13 09:24:50,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 268 flow [2022-12-13 09:24:50,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:24:50,262 INFO L231 Difference]: Finished difference. Result has 50 places, 24 transitions, 58 flow [2022-12-13 09:24:50,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=50, PETRI_TRANSITIONS=24} [2022-12-13 09:24:50,268 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 09:24:50,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:50,269 INFO L89 Accepts]: Start accepts. Operand has 50 places, 24 transitions, 58 flow [2022-12-13 09:24:50,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:50,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:50,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 24 transitions, 58 flow [2022-12-13 09:24:50,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 58 flow [2022-12-13 09:24:50,284 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:24:50,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:50,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 44 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:24:50,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 58 flow [2022-12-13 09:24:50,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 09:24:50,400 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:50,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 09:24:50,402 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 58 flow [2022-12-13 09:24:50,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:24:50,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:50,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:24:50,403 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:24:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1549883303, now seen corresponding path program 1 times [2022-12-13 09:24:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481835353] [2022-12-13 09:24:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:50,636 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:24:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481835353] [2022-12-13 09:24:50,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481835353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:50,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:50,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:24:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29035425] [2022-12-13 09:24:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:50,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:50,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:24:50,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 58 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:24:50,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:50,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:24:50,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:50,742 INFO L130 PetriNetUnfolder]: 237/457 cut-off events. [2022-12-13 09:24:50,743 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 09:24:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 457 events. 237/457 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1968 event pairs, 97 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 911. Up to 256 conditions per place. [2022-12-13 09:24:50,747 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 20 selfloop transitions, 2 changer transitions 3/31 dead transitions. [2022-12-13 09:24:50,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 122 flow [2022-12-13 09:24:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 09:24:50,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 09:24:50,749 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 58 flow. Second operand 3 states and 44 transitions. [2022-12-13 09:24:50,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 122 flow [2022-12-13 09:24:50,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:24:50,751 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 56 flow [2022-12-13 09:24:50,751 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 09:24:50,752 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2022-12-13 09:24:50,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:50,752 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 56 flow [2022-12-13 09:24:50,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:50,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:50,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 56 flow [2022-12-13 09:24:50,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 09:24:50,760 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 09:24:50,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:50,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 37 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:24:50,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 09:24:50,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 09:24:50,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:24:50,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 09:24:50,925 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 54 flow [2022-12-13 09:24:50,925 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:24:50,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:50,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:24:50,925 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:24:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -801678493, now seen corresponding path program 1 times [2022-12-13 09:24:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:50,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326172309] [2022-12-13 09:24:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:51,104 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:24:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:51,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326172309] [2022-12-13 09:24:51,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326172309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:24:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98440028] [2022-12-13 09:24:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:24:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:24:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:24:51,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 09:24:51,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:24:51,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:51,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 09:24:51,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:51,247 INFO L130 PetriNetUnfolder]: 155/328 cut-off events. [2022-12-13 09:24:51,247 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 09:24:51,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 328 events. 155/328 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1484 event pairs, 35 based on Foata normal form. 36/274 useless extension candidates. Maximal degree in co-relation 714. Up to 226 conditions per place. [2022-12-13 09:24:51,249 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 22 selfloop transitions, 7 changer transitions 21/54 dead transitions. [2022-12-13 09:24:51,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 54 transitions, 231 flow [2022-12-13 09:24:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:24:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:24:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 09:24:51,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 09:24:51,258 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 54 flow. Second operand 5 states and 72 transitions. [2022-12-13 09:24:51,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 54 transitions, 231 flow [2022-12-13 09:24:51,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:24:51,260 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 113 flow [2022-12-13 09:24:51,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 09:24:51,262 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -18 predicate places. [2022-12-13 09:24:51,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:51,262 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 113 flow [2022-12-13 09:24:51,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:51,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:51,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 113 flow [2022-12-13 09:24:51,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 113 flow [2022-12-13 09:24:51,280 INFO L130 PetriNetUnfolder]: 45/117 cut-off events. [2022-12-13 09:24:51,281 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 09:24:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 117 events. 45/117 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 535 event pairs, 18 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 298. Up to 76 conditions per place. [2022-12-13 09:24:51,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 113 flow [2022-12-13 09:24:51,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 09:24:51,305 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:51,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 09:24:51,307 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 113 flow [2022-12-13 09:24:51,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:24:51,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:51,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:51,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:24:51,308 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:24:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 949211117, now seen corresponding path program 1 times [2022-12-13 09:24:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:51,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59872541] [2022-12-13 09:24:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:51,470 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:24:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:51,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59872541] [2022-12-13 09:24:51,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59872541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:51,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:51,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:24:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070458210] [2022-12-13 09:24:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:51,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:24:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:24:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:24:51,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 09:24:51,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:24:51,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:51,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 09:24:51,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:51,574 INFO L130 PetriNetUnfolder]: 56/169 cut-off events. [2022-12-13 09:24:51,575 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-13 09:24:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 169 events. 56/169 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 729 event pairs, 8 based on Foata normal form. 27/154 useless extension candidates. Maximal degree in co-relation 519. Up to 88 conditions per place. [2022-12-13 09:24:51,576 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 16 selfloop transitions, 13 changer transitions 12/44 dead transitions. [2022-12-13 09:24:51,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 257 flow [2022-12-13 09:24:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:24:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:24:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 09:24:51,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-13 09:24:51,577 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 113 flow. Second operand 6 states and 66 transitions. [2022-12-13 09:24:51,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 257 flow [2022-12-13 09:24:51,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 218 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 09:24:51,580 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 130 flow [2022-12-13 09:24:51,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-13 09:24:51,580 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -15 predicate places. [2022-12-13 09:24:51,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:51,581 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 130 flow [2022-12-13 09:24:51,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:51,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:51,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 130 flow [2022-12-13 09:24:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 130 flow [2022-12-13 09:24:51,589 INFO L130 PetriNetUnfolder]: 9/62 cut-off events. [2022-12-13 09:24:51,590 INFO L131 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2022-12-13 09:24:51,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 62 events. 9/62 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 226 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 173. Up to 34 conditions per place. [2022-12-13 09:24:51,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 130 flow [2022-12-13 09:24:51,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 09:24:52,018 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:24:52,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-13 09:24:52,020 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 126 flow [2022-12-13 09:24:52,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:24:52,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:52,020 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:52,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:24:52,020 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:24:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash -634402625, now seen corresponding path program 1 times [2022-12-13 09:24:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219826595] [2022-12-13 09:24:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:52,183 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:24:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219826595] [2022-12-13 09:24:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219826595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:52,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:52,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:24:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325424745] [2022-12-13 09:24:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:24:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:24:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:24:52,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2022-12-13 09:24:52,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:24:52,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:52,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2022-12-13 09:24:52,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:52,267 INFO L130 PetriNetUnfolder]: 46/133 cut-off events. [2022-12-13 09:24:52,267 INFO L131 PetriNetUnfolder]: For 235/241 co-relation queries the response was YES. [2022-12-13 09:24:52,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 133 events. 46/133 cut-off events. For 235/241 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 571 event pairs, 0 based on Foata normal form. 15/123 useless extension candidates. Maximal degree in co-relation 472. Up to 81 conditions per place. [2022-12-13 09:24:52,268 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 20 selfloop transitions, 1 changer transitions 15/41 dead transitions. [2022-12-13 09:24:52,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 282 flow [2022-12-13 09:24:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:24:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:24:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 09:24:52,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 09:24:52,270 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 126 flow. Second operand 4 states and 44 transitions. [2022-12-13 09:24:52,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 282 flow [2022-12-13 09:24:52,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 232 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 09:24:52,274 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 99 flow [2022-12-13 09:24:52,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-13 09:24:52,275 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2022-12-13 09:24:52,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:52,276 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 99 flow [2022-12-13 09:24:52,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:52,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:52,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 99 flow [2022-12-13 09:24:52,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 99 flow [2022-12-13 09:24:52,284 INFO L130 PetriNetUnfolder]: 9/48 cut-off events. [2022-12-13 09:24:52,284 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 09:24:52,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 48 events. 9/48 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 161 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 114. Up to 28 conditions per place. [2022-12-13 09:24:52,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 99 flow [2022-12-13 09:24:52,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 09:24:52,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:24:52,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-13 09:24:52,657 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 97 flow [2022-12-13 09:24:52,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:24:52,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:52,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:52,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:24:52,657 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:24:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -117277937, now seen corresponding path program 1 times [2022-12-13 09:24:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543661964] [2022-12-13 09:24:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:53,401 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:24:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:53,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543661964] [2022-12-13 09:24:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543661964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:53,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:53,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:24:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531817804] [2022-12-13 09:24:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:53,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:24:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:24:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:24:53,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-13 09:24:53,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:24:53,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:53,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-13 09:24:53,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:53,518 INFO L130 PetriNetUnfolder]: 31/100 cut-off events. [2022-12-13 09:24:53,518 INFO L131 PetriNetUnfolder]: For 114/119 co-relation queries the response was YES. [2022-12-13 09:24:53,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 100 events. 31/100 cut-off events. For 114/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 398 event pairs, 0 based on Foata normal form. 14/92 useless extension candidates. Maximal degree in co-relation 310. Up to 46 conditions per place. [2022-12-13 09:24:53,519 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 16 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-12-13 09:24:53,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 247 flow [2022-12-13 09:24:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:24:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:24:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-12-13 09:24:53,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 09:24:53,521 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 97 flow. Second operand 7 states and 48 transitions. [2022-12-13 09:24:53,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 247 flow [2022-12-13 09:24:53,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:24:53,523 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 109 flow [2022-12-13 09:24:53,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2022-12-13 09:24:53,524 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2022-12-13 09:24:53,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:53,524 INFO L89 Accepts]: Start accepts. Operand has 36 places, 22 transitions, 109 flow [2022-12-13 09:24:53,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:53,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:53,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 109 flow [2022-12-13 09:24:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 109 flow [2022-12-13 09:24:53,533 INFO L130 PetriNetUnfolder]: 9/50 cut-off events. [2022-12-13 09:24:53,533 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 09:24:53,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 50 events. 9/50 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 158 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 130. Up to 28 conditions per place. [2022-12-13 09:24:53,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 109 flow [2022-12-13 09:24:53,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 09:24:54,749 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:24:54,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1226 [2022-12-13 09:24:54,750 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 138 flow [2022-12-13 09:24:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:24:54,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:54,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:24:54,751 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:24:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -800479535, now seen corresponding path program 1 times [2022-12-13 09:24:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:54,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750970831] [2022-12-13 09:24:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:24:54,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:24:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:24:54,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:24:54,849 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:24:54,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:24:54,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:24:54,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:24:54,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:24:54,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:24:54,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:24:54,852 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:54,857 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:24:54,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:24:54,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:24:54 BasicIcfg [2022-12-13 09:24:54,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:24:54,889 INFO L158 Benchmark]: Toolchain (without parser) took 11321.52ms. Allocated memory was 179.3MB in the beginning and 312.5MB in the end (delta: 133.2MB). Free memory was 153.6MB in the beginning and 270.6MB in the end (delta: -117.0MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-12-13 09:24:54,889 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:24:54,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.80ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 128.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 09:24:54,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.07ms. Allocated memory is still 179.3MB. Free memory was 128.6MB in the beginning and 126.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:24:54,890 INFO L158 Benchmark]: Boogie Preprocessor took 33.50ms. Allocated memory is still 179.3MB. Free memory was 126.3MB in the beginning and 124.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:24:54,890 INFO L158 Benchmark]: RCFGBuilder took 617.31ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 139.9MB in the end (delta: -15.5MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2022-12-13 09:24:54,891 INFO L158 Benchmark]: TraceAbstraction took 10085.59ms. Allocated memory was 179.3MB in the beginning and 312.5MB in the end (delta: 133.2MB). Free memory was 138.8MB in the beginning and 270.6MB in the end (delta: -131.8MB). Peak memory consumption was 860.8kB. Max. memory is 8.0GB. [2022-12-13 09:24:54,892 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.80ms. Allocated memory is still 179.3MB. Free memory was 153.6MB in the beginning and 128.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.07ms. Allocated memory is still 179.3MB. Free memory was 128.6MB in the beginning and 126.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.50ms. Allocated memory is still 179.3MB. Free memory was 126.3MB in the beginning and 124.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 617.31ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 139.9MB in the end (delta: -15.5MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 10085.59ms. Allocated memory was 179.3MB in the beginning and 312.5MB in the end (delta: 133.2MB). Free memory was 138.8MB in the beginning and 270.6MB in the end (delta: -131.8MB). Peak memory consumption was 860.8kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 94 PlacesBefore, 52 PlacesAfterwards, 89 TransitionsBefore, 46 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 4 ChoiceCompositions, 76 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1924, independent: 1830, independent conditional: 1830, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1240, independent: 1203, independent conditional: 0, independent unconditional: 1203, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1240, independent: 1203, independent conditional: 0, independent unconditional: 1203, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1240, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1924, independent: 627, independent conditional: 627, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 1240, unknown conditional: 1240, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1242, Positive cache size: 1205, Positive conditional cache size: 1205, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, 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, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 101, independent conditional: 101, 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: 104, independent: 85, independent conditional: 13, independent unconditional: 72, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 85, independent conditional: 13, independent unconditional: 72, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 91, dependent conditional: 8, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, 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.2s, 30 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 39, independent conditional: 9, independent unconditional: 30, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 39, independent conditional: 9, independent unconditional: 30, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 124, Positive conditional cache size: 124, 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: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 130, Positive conditional cache size: 130, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, 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.4s, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 136, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 137, Positive conditional cache size: 137, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, 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.4s, 30 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 62, independent conditional: 62, 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: 21, independent: 17, independent conditional: 9, independent unconditional: 8, 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: 21, independent: 17, independent conditional: 9, independent unconditional: 8, 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: 21, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, 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.2s, 34 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 8, 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: 8, independent: 8, independent conditional: 8, 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: 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: 13, independent: 5, independent conditional: 5, 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): 193, Positive cache size: 162, Positive conditional cache size: 162, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=1, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:24:54,914 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...