/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:15,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:15,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:15,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:15,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:15,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:15,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:15,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:15,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:15,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:15,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:15,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:15,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:15,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:15,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:15,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:15,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:15,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:15,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:15,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:15,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:15,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:15,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:15,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:15,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:15,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:15,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:15,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:15,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:15,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:15,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:15,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:15,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:15,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:15,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:15,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:15,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:15,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:15,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:15,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:15,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:15,830 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:16:15,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:15,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:15,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:15,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:15,859 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:15,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:15,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:15,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:15,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:15,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:15,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:15,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:15,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:15,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:15,863 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-06 06:16:16,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:16,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:16,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:16,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:16,170 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:16,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-06 06:16:17,154 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:17,420 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:17,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-06 06:16:17,435 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0115355cc/33c77ae7560e4968940282a142658f4b/FLAGa2e2a0c17 [2022-12-06 06:16:17,444 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0115355cc/33c77ae7560e4968940282a142658f4b [2022-12-06 06:16:17,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:17,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:17,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:17,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:17,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:17,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25055245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17, skipping insertion in model container [2022-12-06 06:16:17,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:17,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:17,632 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/mix000.oepc.i[988,1001] [2022-12-06 06:16:17,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:17,816 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:17,826 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/mix000.oepc.i[988,1001] [2022-12-06 06:16:17,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:17,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:17,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:17,908 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:17,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17 WrapperNode [2022-12-06 06:16:17,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:17,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:17,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:17,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:17,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,966 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-06 06:16:17,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:17,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:17,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:17,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:17,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,995 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:17,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:17,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:17,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:17,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:17,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (1/1) ... [2022-12-06 06:16:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:18,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:18,034 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-06 06:16:18,037 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-06 06:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:16:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:16:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:16:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:16:18,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:16:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:16:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:18,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:18,078 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:16:18,178 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:18,180 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:18,411 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:18,542 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:18,543 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:18,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:18 BoogieIcfgContainer [2022-12-06 06:16:18,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:18,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:18,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:18,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:17" (1/3) ... [2022-12-06 06:16:18,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c849c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:18, skipping insertion in model container [2022-12-06 06:16:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:17" (2/3) ... [2022-12-06 06:16:18,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c849c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:18, skipping insertion in model container [2022-12-06 06:16:18,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:18" (3/3) ... [2022-12-06 06:16:18,552 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2022-12-06 06:16:18,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:18,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:18,564 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:18,609 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:16:18,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 06:16:18,691 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 06:16:18,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:18,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:16:18,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 06:16:18,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-06 06:16:18,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:18,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 06:16:18,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-06 06:16:18,746 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 06:16:18,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:18,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:16:18,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 06:16:18,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-06 06:16:22,080 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-06 06:16:22,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:22,097 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;@4a6dba58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:22,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:16:22,099 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:16:22,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:22,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:22,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:16:22,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash 438238, now seen corresponding path program 1 times [2022-12-06 06:16:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:22,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070982224] [2022-12-06 06:16:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:22,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:22,327 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-06 06:16:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070982224] [2022-12-06 06:16:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070982224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:22,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753403314] [2022-12-06 06:16:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:22,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:22,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:16:22,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:22,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:22,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:16:22,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:22,475 INFO L130 PetriNetUnfolder]: 228/410 cut-off events. [2022-12-06 06:16:22,476 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:16:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 410 events. 228/410 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1699 event pairs, 74 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 810. Up to 341 conditions per place. [2022-12-06 06:16:22,478 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 22 selfloop transitions, 2 changer transitions 6/32 dead transitions. [2022-12-06 06:16:22,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 133 flow [2022-12-06 06:16:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:16:22,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2022-12-06 06:16:22,488 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:16:22,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 133 flow [2022-12-06 06:16:22,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:22,491 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2022-12-06 06:16:22,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-06 06:16:22,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 06:16:22,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:22,495 INFO L89 Accepts]: Start accepts. Operand has 27 places, 17 transitions, 42 flow [2022-12-06 06:16:22,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:22,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:22,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 42 flow [2022-12-06 06:16:22,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2022-12-06 06:16:22,501 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 06:16:22,501 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:22,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:16:22,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 42 flow [2022-12-06 06:16:22,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 06:16:22,638 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:22,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 06:16:22,639 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-06 06:16:22,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:22,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:22,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:22,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:22,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1054273575, now seen corresponding path program 1 times [2022-12-06 06:16:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:22,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599999205] [2022-12-06 06:16:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:22,769 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-06 06:16:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:22,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599999205] [2022-12-06 06:16:22,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599999205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:22,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:22,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098461383] [2022-12-06 06:16:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:22,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:22,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:16:22,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 06:16:22,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:22,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:16:22,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:22,835 INFO L130 PetriNetUnfolder]: 207/360 cut-off events. [2022-12-06 06:16:22,835 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 06:16:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1248 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2022-12-06 06:16:22,837 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-12-06 06:16:22,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2022-12-06 06:16:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 06:16:22,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-06 06:16:22,839 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 26 transitions. [2022-12-06 06:16:22,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2022-12-06 06:16:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:22,840 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-12-06 06:16:22,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2022-12-06 06:16:22,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:22,841 INFO L89 Accepts]: Start accepts. Operand has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:22,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:22,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,845 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 06:16:22,846 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 40. Up to 10 conditions per place. [2022-12-06 06:16:22,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:16:22,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:22,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:16:22,908 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2022-12-06 06:16:22,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 06:16:22,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:22,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:22,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:22,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1284983202, now seen corresponding path program 1 times [2022-12-06 06:16:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:22,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421670747] [2022-12-06 06:16:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:23,071 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-06 06:16:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:23,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421670747] [2022-12-06 06:16:23,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421670747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:23,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:23,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667945571] [2022-12-06 06:16:23,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:23,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:23,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:16:23,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:23,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:23,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:16:23,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:23,147 INFO L130 PetriNetUnfolder]: 193/338 cut-off events. [2022-12-06 06:16:23,148 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 06:16:23,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 338 events. 193/338 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1118 event pairs, 65 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 764. Up to 243 conditions per place. [2022-12-06 06:16:23,150 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-12-06 06:16:23,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 119 flow [2022-12-06 06:16:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 06:16:23,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2022-12-06 06:16:23,151 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 25 transitions. [2022-12-06 06:16:23,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 119 flow [2022-12-06 06:16:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:16:23,152 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 06:16:23,153 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 06:16:23,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:23,153 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:23,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:23,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,158 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-06 06:16:23,158 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 06:16:23,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 2/24 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-06 06:16:23,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 06:16:23,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:23,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 06:16:23,166 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2022-12-06 06:16:23,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:23,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:23,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:16:23,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -484695581, now seen corresponding path program 1 times [2022-12-06 06:16:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235012441] [2022-12-06 06:16:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:23,253 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-06 06:16:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:23,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235012441] [2022-12-06 06:16:23,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235012441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:23,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:23,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136829651] [2022-12-06 06:16:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:23,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:16:23,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:23,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:23,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:16:23,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:23,332 INFO L130 PetriNetUnfolder]: 179/316 cut-off events. [2022-12-06 06:16:23,333 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-06 06:16:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 316 events. 179/316 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1052 event pairs, 99 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 746. Up to 237 conditions per place. [2022-12-06 06:16:23,334 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:16:23,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 137 flow [2022-12-06 06:16:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 06:16:23,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 06:16:23,335 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 27 transitions. [2022-12-06 06:16:23,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 137 flow [2022-12-06 06:16:23,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:23,337 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-06 06:16:23,337 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-06 06:16:23,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:23,338 INFO L89 Accepts]: Start accepts. Operand has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:23,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:23,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,342 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-06 06:16:23,342 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-06 06:16:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 22 events. 1/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 35. Up to 6 conditions per place. [2022-12-06 06:16:23,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 06:16:23,354 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:23,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:16:23,355 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2022-12-06 06:16:23,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 06:16:23,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:23,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:16:23,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1175165586, now seen corresponding path program 1 times [2022-12-06 06:16:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:23,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661771198] [2022-12-06 06:16:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661771198] [2022-12-06 06:16:23,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661771198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:23,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:23,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818998741] [2022-12-06 06:16:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:23,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 06:16:23,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 06:16:23,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:23,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 06:16:23,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:23,574 INFO L130 PetriNetUnfolder]: 80/175 cut-off events. [2022-12-06 06:16:23,575 INFO L131 PetriNetUnfolder]: For 68/69 co-relation queries the response was YES. [2022-12-06 06:16:23,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 175 events. 80/175 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 event pairs, 16 based on Foata normal form. 28/202 useless extension candidates. Maximal degree in co-relation 423. Up to 66 conditions per place. [2022-12-06 06:16:23,576 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 23 selfloop transitions, 3 changer transitions 18/47 dead transitions. [2022-12-06 06:16:23,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 236 flow [2022-12-06 06:16:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:16:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:16:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:16:23,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2022-12-06 06:16:23,577 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:16:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 236 flow [2022-12-06 06:16:23,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:23,578 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 91 flow [2022-12-06 06:16:23,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:16:23,579 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 06:16:23,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:23,579 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 91 flow [2022-12-06 06:16:23,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:23,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:23,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 91 flow [2022-12-06 06:16:23,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 91 flow [2022-12-06 06:16:23,585 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 06:16:23,585 INFO L131 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2022-12-06 06:16:23,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 36 events. 6/36 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 2 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 83. Up to 14 conditions per place. [2022-12-06 06:16:23,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 91 flow [2022-12-06 06:16:23,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:16:23,586 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:23,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:16:23,587 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 91 flow [2022-12-06 06:16:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 06:16:23,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:23,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:23,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:16:23,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 627202216, now seen corresponding path program 1 times [2022-12-06 06:16:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:23,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056083460] [2022-12-06 06:16:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:23,725 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-06 06:16:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:23,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056083460] [2022-12-06 06:16:23,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056083460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:23,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:23,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:16:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161053021] [2022-12-06 06:16:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:16:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:16:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:16:23,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 06:16:23,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:23,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:23,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 06:16:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:23,810 INFO L130 PetriNetUnfolder]: 32/86 cut-off events. [2022-12-06 06:16:23,810 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 06:16:23,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 86 events. 32/86 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 237 event pairs, 13 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 240. Up to 41 conditions per place. [2022-12-06 06:16:23,811 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 21 selfloop transitions, 5 changer transitions 9/38 dead transitions. [2022-12-06 06:16:23,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 213 flow [2022-12-06 06:16:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 06:16:23,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 06:16:23,813 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 91 flow. Second operand 6 states and 48 transitions. [2022-12-06 06:16:23,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 213 flow [2022-12-06 06:16:23,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 186 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:23,814 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 90 flow [2022-12-06 06:16:23,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-06 06:16:23,815 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-06 06:16:23,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:23,815 INFO L89 Accepts]: Start accepts. Operand has 35 places, 21 transitions, 90 flow [2022-12-06 06:16:23,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:23,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:23,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 90 flow [2022-12-06 06:16:23,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 90 flow [2022-12-06 06:16:23,821 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-06 06:16:23,822 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 06:16:23,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 24 events. 2/24 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 7 conditions per place. [2022-12-06 06:16:23,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 90 flow [2022-12-06 06:16:23,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:16:24,289 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:16:24,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 06:16:24,290 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 86 flow [2022-12-06 06:16:24,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:24,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:24,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:24,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:16:24,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -355738423, now seen corresponding path program 1 times [2022-12-06 06:16:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:24,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078731799] [2022-12-06 06:16:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:25,252 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-06 06:16:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:25,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078731799] [2022-12-06 06:16:25,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078731799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:25,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:25,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:16:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900056429] [2022-12-06 06:16:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:25,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:16:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:16:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:16:25,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 06:16:25,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-06 06:16:25,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:25,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 06:16:25,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:25,481 INFO L130 PetriNetUnfolder]: 31/89 cut-off events. [2022-12-06 06:16:25,481 INFO L131 PetriNetUnfolder]: For 79/80 co-relation queries the response was YES. [2022-12-06 06:16:25,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 89 events. 31/89 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 272 event pairs, 3 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 243. Up to 25 conditions per place. [2022-12-06 06:16:25,482 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 22 selfloop transitions, 16 changer transitions 8/49 dead transitions. [2022-12-06 06:16:25,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 285 flow [2022-12-06 06:16:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:16:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:16:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-06 06:16:25,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 06:16:25,484 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 86 flow. Second operand 9 states and 60 transitions. [2022-12-06 06:16:25,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 285 flow [2022-12-06 06:16:25,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 258 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 06:16:25,485 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 147 flow [2022-12-06 06:16:25,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=147, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 06:16:25,486 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 06:16:25,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:25,486 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 147 flow [2022-12-06 06:16:25,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:25,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:25,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 147 flow [2022-12-06 06:16:25,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 147 flow [2022-12-06 06:16:25,494 INFO L130 PetriNetUnfolder]: 9/44 cut-off events. [2022-12-06 06:16:25,495 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 06:16:25,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 44 events. 9/44 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 95 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 103. Up to 10 conditions per place. [2022-12-06 06:16:25,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 147 flow [2022-12-06 06:16:25,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 06:16:25,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L807-->L814: Formula: (let ((.cse4 (not (= 0 (mod v_~y$w_buff0_used~0_93 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_48 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_54 (ite .cse0 v_~y$w_buff0~0_31 (ite .cse1 v_~y$w_buff1~0_32 v_~y~0_55))) (= v_~y$w_buff1_used~0_90 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_91)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_51 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_48) v_~y$r_buff1_thd2~0_47) (= v_~y$w_buff0_used~0_93 (ite .cse0 0 v_~y$w_buff0_used~0_94)) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_52) v_~y$r_buff0_thd2~0_51)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [315] L752-->L768: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd1~0_62 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd1~0_67 256) 0))) (let ((.cse11 (not .cse10)) (.cse6 (and .cse4 .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_146 256) 0)) (.cse7 (and (= (mod v_~y$w_buff1_used~0_137 256) 0) .cse10))) (let ((.cse8 (or .cse6 .cse12 .cse7)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse5 (ite .cse8 v_~y~0_102 (ite .cse9 v_~y$w_buff0~0_62 v_~y$w_buff1~0_67))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse2 (= (mod v_~y$w_buff1_used~0_136 256) 0)) (.cse3 (= 0 (mod v_~y$w_buff0_used~0_145 256)))) (and (= v_~y$w_buff1~0_67 v_~y$w_buff1~0_66) (= (ite .cse0 v_~y$r_buff1_thd1~0_62 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd1~0_62 0)) v_~y$r_buff1_thd1~0_61) (= |v_P0Thread1of1ForFork0_#t~nondet4#1_1| v_~weak$$choice2~0_66) (= v_~y$w_buff0~0_62 v_~y$w_buff0~0_61) (= 0 v_~y$flush_delayed~0_48) (= .cse5 v_~__unbuffered_p0_EAX~0_10) (= (ite .cse0 v_~y$mem_tmp~0_36 .cse5) v_~y~0_100) (= (ite .cse0 v_~y$w_buff1_used~0_137 (ite (or .cse6 .cse3 .cse7) v_~y$w_buff1_used~0_137 0)) v_~y$w_buff1_used~0_136) (= v_~y$w_buff0_used~0_145 (ite .cse0 v_~y$w_buff0_used~0_146 (ite .cse8 v_~y$w_buff0_used~0_146 (ite .cse9 0 v_~y$w_buff0_used~0_146)))) (= v_~y~0_102 v_~y$mem_tmp~0_36) (= v_~y$r_buff0_thd1~0_66 (ite .cse0 v_~y$r_buff0_thd1~0_67 (ite (or (and .cse10 .cse2) .cse6 .cse3) v_~y$r_buff0_thd1~0_67 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd1~0_67)))) (= |v_P0Thread1of1ForFork0_#t~nondet3#1_1| v_~weak$$choice0~0_18)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_62, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_146, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_62, P0Thread1of1ForFork0_#t~nondet4#1=|v_P0Thread1of1ForFork0_#t~nondet4#1_1|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, P0Thread1of1ForFork0_#t~nondet3#1=|v_P0Thread1of1ForFork0_#t~nondet3#1_1|, ~y~0=v_~y~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_145, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_61, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_36, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~y$w_buff1~0=v_~y$w_buff1~0_66, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, ~y~0=v_~y~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_136} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_#t~nondet4#1, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet3#1, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:16:26,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_88 1) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$w_buff0_used~0_192 v_~y$w_buff1_used~0_172) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_191 256) 0)) (not (= (mod v_~y$w_buff1_used~0_172 256) 0)))) 1 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_39) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~y$r_buff0_thd2~0_89 v_~y$r_buff1_thd2~0_81) (= v_~y$w_buff0_used~0_191 1) (= v_~y$w_buff0~0_95 1) (= v_~y$w_buff0~0_96 v_~y$w_buff1~0_96) (= v_~y$r_buff0_thd1~0_89 v_~y$r_buff1_thd1~0_79) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_192, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_89, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_191, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_95, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_88, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [324] L791-->L807: Formula: (let ((.cse4 (= 0 (mod v_~y$r_buff1_thd2~0_56 256))) (.cse6 (= (mod v_~y$r_buff0_thd2~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_142 256) 0)) (.cse7 (and .cse4 .cse6)) (.cse11 (and .cse6 (= (mod v_~y$w_buff1_used~0_133 256) 0)))) (let ((.cse9 (or .cse12 .cse7 .cse11)) (.cse10 (and (not .cse12) .cse8))) (let ((.cse1 (ite .cse9 v_~y~0_96 (ite .cse10 v_~y$w_buff0~0_58 v_~y$w_buff1~0_63))) (.cse2 (= (mod v_~y$w_buff1_used~0_132 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse5 (= (mod v_~y$w_buff0_used~0_141 256) 0))) (and (= v_~y~0_94 (ite .cse0 v_~y$mem_tmp~0_34 .cse1)) (= v_~weak$$choice0~0_16 |v_P1Thread1of1ForFork1_#t~nondet5_1|) (= (ite .cse0 v_~y$r_buff1_thd2~0_56 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd2~0_61 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) v_~y$r_buff1_thd2~0_56 0)) v_~y$r_buff1_thd2~0_55) (= v_~y$w_buff1~0_63 v_~y$w_buff1~0_62) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_96 v_~y$mem_tmp~0_34) (= v_~__unbuffered_p1_EBX~0_8 .cse1) (= (ite .cse0 v_~y$r_buff0_thd2~0_62 (ite (or (and .cse2 .cse6) .cse7 .cse5) v_~y$r_buff0_thd2~0_62 (ite (and .cse8 (not .cse5)) 0 v_~y$r_buff0_thd2~0_62))) v_~y$r_buff0_thd2~0_61) (= v_~y$w_buff0_used~0_141 (ite .cse0 v_~y$w_buff0_used~0_142 (ite .cse9 v_~y$w_buff0_used~0_142 (ite .cse10 0 v_~y$w_buff0_used~0_142)))) (= v_~y$w_buff1_used~0_132 (ite .cse0 v_~y$w_buff1_used~0_133 (ite (or .cse7 .cse5 .cse11) v_~y$w_buff1_used~0_133 0))) (= v_~y$w_buff0~0_58 v_~y$w_buff0~0_57) (= v_~weak$$choice2~0_64 |v_P1Thread1of1ForFork1_#t~nondet6_1|)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_142, ~y$w_buff1~0=v_~y$w_buff1~0_63, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_1|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_1|, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y~0=v_~y~0_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_133} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_141, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_62, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_132} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_#t~nondet5, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:16:26,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_88 1) (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$w_buff0_used~0_192 v_~y$w_buff1_used~0_172) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_191 256) 0)) (not (= (mod v_~y$w_buff1_used~0_172 256) 0)))) 1 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_39) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~y$r_buff0_thd2~0_89 v_~y$r_buff1_thd2~0_81) (= v_~y$w_buff0_used~0_191 1) (= v_~y$w_buff0~0_95 1) (= v_~y$w_buff0~0_96 v_~y$w_buff1~0_96) (= v_~y$r_buff0_thd1~0_89 v_~y$r_buff1_thd1~0_79) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_192, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_89, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_191, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_95, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_88, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [325] L807-->L814: Formula: (let ((.cse4 (not (= 0 (mod v_~y$w_buff0_used~0_93 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_48 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_54 (ite .cse0 v_~y$w_buff0~0_31 (ite .cse1 v_~y$w_buff1~0_32 v_~y~0_55))) (= v_~y$w_buff1_used~0_90 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_91)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_51 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_48) v_~y$r_buff1_thd2~0_47) (= v_~y$w_buff0_used~0_93 (ite .cse0 0 v_~y$w_buff0_used~0_94)) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_52) v_~y$r_buff0_thd2~0_51)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:16:27,134 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:16:27,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1649 [2022-12-06 06:16:27,135 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 141 flow [2022-12-06 06:16:27,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-06 06:16:27,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:27,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:27,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:16:27,135 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -604618364, now seen corresponding path program 1 times [2022-12-06 06:16:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649734140] [2022-12-06 06:16:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:27,267 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-06 06:16:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:27,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649734140] [2022-12-06 06:16:27,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649734140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:27,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:27,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:27,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951309088] [2022-12-06 06:16:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:27,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:27,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:16:27,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 141 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 06:16:27,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:27,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:16:27,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:27,347 INFO L130 PetriNetUnfolder]: 38/102 cut-off events. [2022-12-06 06:16:27,347 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 06:16:27,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 102 events. 38/102 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 321 event pairs, 11 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 336. Up to 47 conditions per place. [2022-12-06 06:16:27,348 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 1 changer transitions 26/42 dead transitions. [2022-12-06 06:16:27,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 292 flow [2022-12-06 06:16:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:16:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:16:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 06:16:27,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-06 06:16:27,349 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 141 flow. Second operand 4 states and 31 transitions. [2022-12-06 06:16:27,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 292 flow [2022-12-06 06:16:27,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 282 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:16:27,352 INFO L231 Difference]: Finished difference. Result has 37 places, 16 transitions, 79 flow [2022-12-06 06:16:27,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=37, PETRI_TRANSITIONS=16} [2022-12-06 06:16:27,355 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-12-06 06:16:27,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:27,355 INFO L89 Accepts]: Start accepts. Operand has 37 places, 16 transitions, 79 flow [2022-12-06 06:16:27,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:27,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:27,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 16 transitions, 79 flow [2022-12-06 06:16:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 16 transitions, 79 flow [2022-12-06 06:16:27,359 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-06 06:16:27,359 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:16:27,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 21 events. 1/21 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 49. Up to 5 conditions per place. [2022-12-06 06:16:27,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 16 transitions, 79 flow [2022-12-06 06:16:27,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 06:16:28,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [428] $Ultimate##0-->L771: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_130 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_491 256) 0))) (and (= v_~y$w_buff1~0_270 v_~y$w_buff0~0_300) (= v_~y$w_buff0~0_299 1) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_491) (= v_~y$r_buff0_thd0~0_166 v_~y$r_buff1_thd0~0_164) (= (ite .cse0 v_~y$w_buff0_used~0_492 (ite .cse1 v_~y$w_buff0_used~0_492 0)) v_~y$w_buff1_used~0_440) (= (ite (= (mod v_~y$w_buff0_used~0_492 256) 0) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_51| |v_P0Thread1of1ForFork0_~arg#1.offset_51|) (= (ite .cse0 v_~y$r_buff0_thd1~0_243 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd1~0_242 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_440 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd1~0_243 256) 0)) .cse1)) v_~y$r_buff0_thd1~0_243 0)) v_~y$r_buff1_thd1~0_189) (= v_~y~0_382 (ite .cse0 v_~y$mem_tmp~0_98 v_~y$w_buff0~0_299)) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| 0)) (= v_~__unbuffered_p0_EAX~0_91 v_~y$w_buff0~0_299) (= |v_P0Thread1of1ForFork0_#t~nondet3#1_46| v_~weak$$choice0~0_86) (= v_~weak$$choice2~0_130 |v_P0Thread1of1ForFork0_#t~nondet4#1_46|) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd1~0_242) (= v_~y$flush_delayed~0_110 0) (= |v_P0Thread1of1ForFork0_~arg#1.base_51| |v_P0Thread1of1ForFork0_#in~arg#1.base_51|) (= v_~__unbuffered_p0_EBX~0_75 v_~x~0_55) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|) (= v_~y~0_383 v_~y$mem_tmp~0_98) (= v_~y$r_buff0_thd2~0_239 v_~y$r_buff1_thd2~0_238))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_51|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$w_buff0~0=v_~y$w_buff0~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_166, P0Thread1of1ForFork0_#t~nondet4#1=|v_P0Thread1of1ForFork0_#t~nondet4#1_46|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_243, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_239, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_51|, P0Thread1of1ForFork0_#t~nondet3#1=|v_P0Thread1of1ForFork0_#t~nondet3#1_46|, ~y~0=v_~y~0_383, ~x~0=v_~x~0_55} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_491, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_51|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_51|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_189, ~y$mem_tmp~0=v_~y$mem_tmp~0_98, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_299, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_242, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|, ~y$flush_delayed~0=v_~y$flush_delayed~0_110, ~y~0=v_~y~0_382, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_75, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_51|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_51|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_238, ~weak$$choice0~0=v_~weak$$choice0~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_270, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_166, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_239, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_55, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_440} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#t~nondet4#1, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet3#1, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [427] $Ultimate##0-->L807: Formula: (let ((.cse5 (= 0 (mod v_~y$r_buff1_thd2~0_235 256))) (.cse10 (= (mod v_~y$r_buff0_thd2~0_236 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_488 256) 0)) (.cse8 (and .cse10 .cse5)) (.cse9 (and .cse10 (= (mod v_~y$w_buff1_used~0_437 256) 0)))) (let ((.cse2 (or .cse12 .cse8 .cse9)) (.cse3 (and (not .cse12) .cse11))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_436 256) 0)) (.cse6 (= 0 (mod v_~y$w_buff0_used~0_487 256))) (.cse1 (not (= (mod v_~weak$$choice2~0_128 256) 0))) (.cse0 (ite .cse2 v_~y~0_379 (ite .cse3 v_~y$w_buff0~0_296 v_~y$w_buff1~0_267)))) (and (= v_~y$flush_delayed~0_108 0) (= v_~__unbuffered_p1_EBX~0_93 .cse0) (= v_~x~0_53 v_~__unbuffered_p1_EAX~0_70) (= v_~y~0_379 v_~y$mem_tmp~0_96) (= v_~weak$$choice2~0_128 |v_P1Thread1of1ForFork1_#t~nondet6_66|) (= v_~y$w_buff0_used~0_487 (ite .cse1 v_~y$w_buff0_used~0_488 (ite .cse2 v_~y$w_buff0_used~0_488 (ite .cse3 0 v_~y$w_buff0_used~0_488)))) (= v_~weak$$choice0~0_84 |v_P1Thread1of1ForFork1_#t~nondet5_66|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= v_~x~0_53 1) (= v_~y$w_buff1~0_267 v_~y$w_buff1~0_266) (= v_~y$w_buff0~0_296 v_~y$w_buff0~0_295) (= (ite .cse1 v_~y$r_buff1_thd2~0_235 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd2~0_235 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse4 .cse7))) v_~y$r_buff1_thd2~0_235 0)) v_~y$r_buff1_thd2~0_234) (= v_~y$w_buff1_used~0_436 (ite .cse1 v_~y$w_buff1_used~0_437 (ite (or .cse6 .cse8 .cse9) v_~y$w_buff1_used~0_437 0))) (= v_~y$r_buff0_thd2~0_235 (ite .cse1 v_~y$r_buff0_thd2~0_236 (ite (or (and .cse7 .cse10) .cse6 .cse8) v_~y$r_buff0_thd2~0_236 (ite (and (not .cse6) .cse11) 0 v_~y$r_buff0_thd2~0_236)))) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|) (= v_~y~0_378 (ite .cse1 v_~y$mem_tmp~0_96 .cse0))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_488, ~y$w_buff1~0=v_~y$w_buff1~0_267, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_66|, P1Thread1of1ForFork1_#t~nondet5=|v_P1Thread1of1ForFork1_#t~nondet5_66|, ~y$w_buff0~0=v_~y$w_buff0~0_296, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_236, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~y~0=v_~y~0_379, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_437} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_487, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_234, ~weak$$choice0~0=v_~weak$$choice0~0_84, ~y$mem_tmp~0=v_~y$mem_tmp~0_96, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, ~y$w_buff1~0=v_~y$w_buff1~0_266, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_295, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_235, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, ~y$flush_delayed~0=v_~y$flush_delayed~0_108, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~y~0=v_~y~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_128, ~x~0=v_~x~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_436} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet5, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-06 06:16:28,631 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:16:28,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1279 [2022-12-06 06:16:28,634 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 12 transitions, 67 flow [2022-12-06 06:16:28,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 06:16:28,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:28,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:28,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:16:28,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash 451391617, now seen corresponding path program 1 times [2022-12-06 06:16:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:28,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341080130] [2022-12-06 06:16:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:28,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:16:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:28,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:16:28,725 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:16:28,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:16:28,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:16:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:16:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:16:28,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:16:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:16:28,727 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:28,731 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:16:28,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:16:28,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:16:28 BasicIcfg [2022-12-06 06:16:28,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:16:28,758 INFO L158 Benchmark]: Toolchain (without parser) took 11311.36ms. Allocated memory was 182.5MB in the beginning and 489.7MB in the end (delta: 307.2MB). Free memory was 157.1MB in the beginning and 270.9MB in the end (delta: -113.8MB). Peak memory consumption was 194.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,758 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:16:28,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.99ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.5MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.90ms. Allocated memory is still 182.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,759 INFO L158 Benchmark]: Boogie Preprocessor took 31.73ms. Allocated memory is still 182.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,759 INFO L158 Benchmark]: RCFGBuilder took 546.03ms. Allocated memory was 182.5MB in the beginning and 241.2MB in the end (delta: 58.7MB). Free memory was 125.8MB in the beginning and 216.1MB in the end (delta: -90.3MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,759 INFO L158 Benchmark]: TraceAbstraction took 10211.54ms. Allocated memory was 241.2MB in the beginning and 489.7MB in the end (delta: 248.5MB). Free memory was 215.2MB in the beginning and 270.9MB in the end (delta: -55.8MB). Peak memory consumption was 192.2MB. Max. memory is 8.0GB. [2022-12-06 06:16:28,760 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.10ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 460.99ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.5MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.90ms. Allocated memory is still 182.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.73ms. Allocated memory is still 182.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.03ms. Allocated memory was 182.5MB in the beginning and 241.2MB in the end (delta: 58.7MB). Free memory was 125.8MB in the beginning and 216.1MB in the end (delta: -90.3MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10211.54ms. Allocated memory was 241.2MB in the beginning and 489.7MB in the end (delta: 248.5MB). Free memory was 215.2MB in the beginning and 270.9MB in the end (delta: -55.8MB). Peak memory consumption was 192.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 95 PlacesBefore, 29 PlacesAfterwards, 90 TransitionsBefore, 23 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 921, independent: 872, independent conditional: 872, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 921, independent: 872, independent conditional: 0, independent unconditional: 872, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 921, independent: 872, independent conditional: 0, independent unconditional: 872, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 921, independent: 872, independent conditional: 0, independent unconditional: 872, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 722, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 722, independent: 684, independent conditional: 0, independent unconditional: 684, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 921, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 722, unknown conditional: 0, unknown unconditional: 722] , Statistics on independence cache: Total cache size (in pairs): 1072, Positive cache size: 1042, Positive conditional cache size: 0, Positive unconditional cache size: 1042, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 71, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 71, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 132, dependent conditional: 32, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 71, unknown conditional: 15, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 54, Positive conditional cache size: 9, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 6, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 5, independent unconditional: 13, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 69, Positive conditional cache size: 9, Positive unconditional cache size: 60, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 33 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 8, independent unconditional: 46, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 76, Positive conditional cache size: 9, Positive unconditional cache size: 67, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 36 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 94, independent conditional: 52, independent unconditional: 42, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 94, independent conditional: 51, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 94, independent conditional: 51, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 112, independent: 92, independent conditional: 49, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 101, Positive conditional cache size: 11, Positive unconditional cache size: 90, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 33 PlacesBefore, 29 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 22, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 106, Positive conditional cache size: 12, Positive unconditional cache size: 94, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t1; [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 [L770] 1 __unbuffered_p0_EBX = x [L787] 1 x = 1 [L790] 1 __unbuffered_p1_EAX = x [L793] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 1 y$flush_delayed = weak$$choice2 [L796] 1 y$mem_tmp = y [L797] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 1 __unbuffered_p1_EBX = y [L805] 1 y = y$flush_delayed ? y$mem_tmp : y [L806] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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, 112 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: 10.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 7 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 36, 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.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:16:28,799 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...