/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:36:54,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:36:54,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:36:54,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:36:54,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:36:54,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:36:54,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:36:54,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:36:54,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:36:54,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:36:54,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:36:54,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:36:54,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:36:54,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:36:54,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:36:54,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:36:54,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:36:54,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:36:54,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:36:54,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:36:54,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:36:54,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:36:54,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:36:54,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:36:54,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:36:54,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:36:54,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:36:54,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:36:54,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:36:54,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:36:54,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:36:54,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:36:54,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:36:54,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:36:54,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:36:54,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:36:54,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:36:54,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:36:54,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:36:54,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:36:54,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:36:54,946 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-SemanticLbe.epf [2022-12-12 21:36:54,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:36:54,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:36:54,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:36:54,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:36:54,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:36:54,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:36:54,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:36:54,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:36:54,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:54,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:36:54,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:36:54,974 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:36:55,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:36:55,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:36:55,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:36:55,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:36:55,249 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:36:55,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-12 21:36:56,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:36:56,406 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:36:56,406 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-12 21:36:56,421 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a77f667/b6ec04bd1e1d459a834bc5fadb77caf9/FLAG4caa2852c [2022-12-12 21:36:56,431 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a77f667/b6ec04bd1e1d459a834bc5fadb77caf9 [2022-12-12 21:36:56,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:36:56,434 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:36:56,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:56,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:36:56,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:36:56,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39eaee03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56, skipping insertion in model container [2022-12-12 21:36:56,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:36:56,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:36:56,580 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/mix037_tso.oepc.i[949,962] [2022-12-12 21:36:56,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:56,803 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:36:56,811 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/mix037_tso.oepc.i[949,962] [2022-12-12 21:36:56,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:56,906 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:36:56,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56 WrapperNode [2022-12-12 21:36:56,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:56,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:56,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:36:56,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:36:56,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,966 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-12 21:36:56,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:56,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:36:56,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:36:56,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:36:56,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:57,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:57,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:57,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:36:57,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:36:57,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:36:57,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:36:57,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:57,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:57,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:36:57,044 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-12 21:36:57,064 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-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:36:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:36:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:36:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:36:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:36:57,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:36:57,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:36:57,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:36:57,081 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:36:57,248 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:36:57,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:36:57,514 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:36:57,689 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:36:57,689 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:36:57,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57 BoogieIcfgContainer [2022-12-12 21:36:57,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:36:57,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:36:57,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:36:57,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:36:57,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:36:56" (1/3) ... [2022-12-12 21:36:57,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e390d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (2/3) ... [2022-12-12 21:36:57,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e390d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57" (3/3) ... [2022-12-12 21:36:57,696 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2022-12-12 21:36:57,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:36:57,709 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:36:57,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:36:57,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:36:57,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 21:36:57,936 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 21:36:57,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:57,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 21:36:57,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 21:36:57,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-12 21:36:57,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:36:57,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 21:36:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-12 21:36:58,035 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 21:36:58,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:58,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 21:36:58,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 21:36:58,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 3256 [2022-12-12 21:37:07,457 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-12 21:37:07,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:37:07,474 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13e35abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:37:07,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:37:07,488 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-12 21:37:07,488 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:07,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:07,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:37:07,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash 546666744, now seen corresponding path program 1 times [2022-12-12 21:37:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:07,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480697913] [2022-12-12 21:37:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:07,881 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-12 21:37:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:07,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480697913] [2022-12-12 21:37:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480697913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:07,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:07,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136336156] [2022-12-12 21:37:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:07,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 21:37:07,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12 21:37:07,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:07,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 21:37:07,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:16,367 INFO L130 PetriNetUnfolder]: 69199/97714 cut-off events. [2022-12-12 21:37:16,368 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-12 21:37:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189142 conditions, 97714 events. 69199/97714 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4911. Compared 723953 event pairs, 25733 based on Foata normal form. 0/58691 useless extension candidates. Maximal degree in co-relation 189130. Up to 76377 conditions per place. [2022-12-12 21:37:16,690 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 46 selfloop transitions, 2 changer transitions 64/128 dead transitions. [2022-12-12 21:37:16,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 498 flow [2022-12-12 21:37:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-12-12 21:37:16,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965811965811965 [2022-12-12 21:37:16,703 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2022-12-12 21:37:16,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 128 transitions, 498 flow [2022-12-12 21:37:16,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 64 transitions, 242 flow [2022-12-12 21:37:16,805 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 242 flow [2022-12-12 21:37:16,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-12 21:37:16,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:16,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:16,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:37:16,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1932795283, now seen corresponding path program 1 times [2022-12-12 21:37:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680834395] [2022-12-12 21:37:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:17,228 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-12 21:37:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680834395] [2022-12-12 21:37:17,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680834395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:17,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:17,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259784328] [2022-12-12 21:37:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:17,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:17,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 21:37:17,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 21:37:17,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:17,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 21:37:17,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:19,369 INFO L130 PetriNetUnfolder]: 20543/28439 cut-off events. [2022-12-12 21:37:19,369 INFO L131 PetriNetUnfolder]: For 4543/4543 co-relation queries the response was YES. [2022-12-12 21:37:19,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78726 conditions, 28439 events. 20543/28439 cut-off events. For 4543/4543 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 160072 event pairs, 2323 based on Foata normal form. 648/24201 useless extension candidates. Maximal degree in co-relation 78711. Up to 19433 conditions per place. [2022-12-12 21:37:19,557 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 76 selfloop transitions, 2 changer transitions 2/91 dead transitions. [2022-12-12 21:37:19,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 504 flow [2022-12-12 21:37:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-12 21:37:19,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-12 21:37:19,560 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -30 predicate places. [2022-12-12 21:37:19,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 91 transitions, 504 flow [2022-12-12 21:37:19,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 89 transitions, 492 flow [2022-12-12 21:37:19,677 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 89 transitions, 492 flow [2022-12-12 21:37:19,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 21:37:19,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:19,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:37:19,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1989849620, now seen corresponding path program 1 times [2022-12-12 21:37:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:19,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908059793] [2022-12-12 21:37:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:20,212 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-12 21:37:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908059793] [2022-12-12 21:37:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908059793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:20,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:20,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472162413] [2022-12-12 21:37:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:20,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:20,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2022-12-12 21:37:20,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 89 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12 21:37:20,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:20,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2022-12-12 21:37:20,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:21,956 INFO L130 PetriNetUnfolder]: 17867/24828 cut-off events. [2022-12-12 21:37:21,956 INFO L131 PetriNetUnfolder]: For 13793/13793 co-relation queries the response was YES. [2022-12-12 21:37:22,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88874 conditions, 24828 events. 17867/24828 cut-off events. For 13793/13793 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 137818 event pairs, 1137 based on Foata normal form. 180/21190 useless extension candidates. Maximal degree in co-relation 88856. Up to 18051 conditions per place. [2022-12-12 21:37:22,113 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 90 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2022-12-12 21:37:22,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 114 transitions, 841 flow [2022-12-12 21:37:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-12 21:37:22,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-12 21:37:22,115 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -28 predicate places. [2022-12-12 21:37:22,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 114 transitions, 841 flow [2022-12-12 21:37:22,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 114 transitions, 841 flow [2022-12-12 21:37:22,233 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 114 transitions, 841 flow [2022-12-12 21:37:22,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-12 21:37:22,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:22,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:22,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:37:22,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1555767468, now seen corresponding path program 1 times [2022-12-12 21:37:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:22,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302145438] [2022-12-12 21:37:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:22,844 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-12 21:37:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:22,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302145438] [2022-12-12 21:37:22,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302145438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:22,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:22,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695845503] [2022-12-12 21:37:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:37:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:37:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:37:22,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 21:37:22,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 114 transitions, 841 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-12 21:37:22,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:22,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 21:37:22,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:24,917 INFO L130 PetriNetUnfolder]: 17723/24691 cut-off events. [2022-12-12 21:37:24,918 INFO L131 PetriNetUnfolder]: For 12062/12062 co-relation queries the response was YES. [2022-12-12 21:37:24,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111946 conditions, 24691 events. 17723/24691 cut-off events. For 12062/12062 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 135807 event pairs, 1161 based on Foata normal form. 36/20909 useless extension candidates. Maximal degree in co-relation 111925. Up to 22318 conditions per place. [2022-12-12 21:37:25,102 INFO L137 encePairwiseOnDemand]: 71/78 looper letters, 151 selfloop transitions, 20 changer transitions 0/182 dead transitions. [2022-12-12 21:37:25,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 182 transitions, 1697 flow [2022-12-12 21:37:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-12 21:37:25,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-12 21:37:25,107 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -25 predicate places. [2022-12-12 21:37:25,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 182 transitions, 1697 flow [2022-12-12 21:37:25,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 182 transitions, 1697 flow [2022-12-12 21:37:25,228 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 182 transitions, 1697 flow [2022-12-12 21:37:25,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-12 21:37:25,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:25,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:25,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:37:25,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1542677031, now seen corresponding path program 1 times [2022-12-12 21:37:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580983533] [2022-12-12 21:37:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:25,513 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-12 21:37:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:25,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580983533] [2022-12-12 21:37:25,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580983533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:25,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:25,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841071130] [2022-12-12 21:37:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:25,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:25,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 78 [2022-12-12 21:37:25,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 182 transitions, 1697 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 21:37:25,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:25,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 78 [2022-12-12 21:37:25,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:28,643 INFO L130 PetriNetUnfolder]: 28404/38437 cut-off events. [2022-12-12 21:37:28,644 INFO L131 PetriNetUnfolder]: For 65975/66685 co-relation queries the response was YES. [2022-12-12 21:37:28,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198216 conditions, 38437 events. 28404/38437 cut-off events. For 65975/66685 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 212815 event pairs, 2938 based on Foata normal form. 406/33089 useless extension candidates. Maximal degree in co-relation 198192. Up to 33356 conditions per place. [2022-12-12 21:37:28,945 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 178 selfloop transitions, 35 changer transitions 0/244 dead transitions. [2022-12-12 21:37:28,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 244 transitions, 2729 flow [2022-12-12 21:37:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-12 21:37:28,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2022-12-12 21:37:28,947 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -23 predicate places. [2022-12-12 21:37:28,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 244 transitions, 2729 flow [2022-12-12 21:37:29,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 244 transitions, 2729 flow [2022-12-12 21:37:29,114 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 244 transitions, 2729 flow [2022-12-12 21:37:29,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 21:37:29,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:29,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:29,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:37:29,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1020825844, now seen corresponding path program 1 times [2022-12-12 21:37:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:29,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088469968] [2022-12-12 21:37:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:29,223 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-12 21:37:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:29,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088469968] [2022-12-12 21:37:29,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088469968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:29,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:29,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106926927] [2022-12-12 21:37:29,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:29,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:29,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:29,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 78 [2022-12-12 21:37:29,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 244 transitions, 2729 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-12 21:37:29,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:29,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 78 [2022-12-12 21:37:29,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:31,430 INFO L130 PetriNetUnfolder]: 18051/25760 cut-off events. [2022-12-12 21:37:31,430 INFO L131 PetriNetUnfolder]: For 56336/58254 co-relation queries the response was YES. [2022-12-12 21:37:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155003 conditions, 25760 events. 18051/25760 cut-off events. For 56336/58254 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 152155 event pairs, 1386 based on Foata normal form. 1774/23933 useless extension candidates. Maximal degree in co-relation 154976. Up to 22134 conditions per place. [2022-12-12 21:37:31,624 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 195 selfloop transitions, 67 changer transitions 0/293 dead transitions. [2022-12-12 21:37:31,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 293 transitions, 3818 flow [2022-12-12 21:37:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-12-12 21:37:31,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-12 21:37:31,627 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2022-12-12 21:37:31,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 293 transitions, 3818 flow [2022-12-12 21:37:31,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 293 transitions, 3818 flow [2022-12-12 21:37:31,756 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 293 transitions, 3818 flow [2022-12-12 21:37:31,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-12 21:37:31,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:31,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:31,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:37:31,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 34743732, now seen corresponding path program 1 times [2022-12-12 21:37:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423577894] [2022-12-12 21:37:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:32,057 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-12 21:37:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423577894] [2022-12-12 21:37:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423577894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:32,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:32,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125008549] [2022-12-12 21:37:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:32,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 78 [2022-12-12 21:37:32,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 293 transitions, 3818 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-12 21:37:32,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:32,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 78 [2022-12-12 21:37:32,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:33,508 INFO L130 PetriNetUnfolder]: 10386/15490 cut-off events. [2022-12-12 21:37:33,508 INFO L131 PetriNetUnfolder]: For 49236/51920 co-relation queries the response was YES. [2022-12-12 21:37:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106579 conditions, 15490 events. 10386/15490 cut-off events. For 49236/51920 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 91331 event pairs, 337 based on Foata normal form. 2101/15300 useless extension candidates. Maximal degree in co-relation 106549. Up to 13042 conditions per place. [2022-12-12 21:37:33,624 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 189 selfloop transitions, 91 changer transitions 0/311 dead transitions. [2022-12-12 21:37:33,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 311 transitions, 4601 flow [2022-12-12 21:37:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:37:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:37:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2022-12-12 21:37:33,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2022-12-12 21:37:33,626 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2022-12-12 21:37:33,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 311 transitions, 4601 flow [2022-12-12 21:37:33,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 311 transitions, 4601 flow [2022-12-12 21:37:33,711 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 311 transitions, 4601 flow [2022-12-12 21:37:33,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-12 21:37:33,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:33,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:33,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:37:33,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1701477353, now seen corresponding path program 1 times [2022-12-12 21:37:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:33,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065129183] [2022-12-12 21:37:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:34,100 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-12 21:37:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:34,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065129183] [2022-12-12 21:37:34,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065129183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:34,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:34,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818195084] [2022-12-12 21:37:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:34,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:34,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 21:37:34,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 311 transitions, 4601 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12 21:37:34,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:34,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 21:37:34,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:36,365 INFO L130 PetriNetUnfolder]: 14796/22366 cut-off events. [2022-12-12 21:37:36,366 INFO L131 PetriNetUnfolder]: For 64335/66110 co-relation queries the response was YES. [2022-12-12 21:37:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173415 conditions, 22366 events. 14796/22366 cut-off events. For 64335/66110 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 143835 event pairs, 613 based on Foata normal form. 583/19441 useless extension candidates. Maximal degree in co-relation 173382. Up to 18839 conditions per place. [2022-12-12 21:37:36,522 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 471 selfloop transitions, 29 changer transitions 64/587 dead transitions. [2022-12-12 21:37:36,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 587 transitions, 9920 flow [2022-12-12 21:37:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-12 21:37:36,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2022-12-12 21:37:36,524 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -11 predicate places. [2022-12-12 21:37:36,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 587 transitions, 9920 flow [2022-12-12 21:37:36,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 523 transitions, 8768 flow [2022-12-12 21:37:36,645 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 523 transitions, 8768 flow [2022-12-12 21:37:36,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12 21:37:36,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:36,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:37:36,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:36,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1210285539, now seen corresponding path program 2 times [2022-12-12 21:37:36,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:36,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740590043] [2022-12-12 21:37:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:37,608 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-12 21:37:37,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:37,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740590043] [2022-12-12 21:37:37,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740590043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:37,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:37,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:37:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582427651] [2022-12-12 21:37:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:37,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:37:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:37:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:37:37,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2022-12-12 21:37:37,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 523 transitions, 8768 flow. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 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-12 21:37:37,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:37,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2022-12-12 21:37:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:42,391 INFO L130 PetriNetUnfolder]: 24359/38648 cut-off events. [2022-12-12 21:37:42,391 INFO L131 PetriNetUnfolder]: For 147303/151046 co-relation queries the response was YES. [2022-12-12 21:37:42,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330169 conditions, 38648 events. 24359/38648 cut-off events. For 147303/151046 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 296194 event pairs, 1020 based on Foata normal form. 718/32609 useless extension candidates. Maximal degree in co-relation 330133. Up to 32964 conditions per place. [2022-12-12 21:37:42,666 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 707 selfloop transitions, 103 changer transitions 208/1080 dead transitions. [2022-12-12 21:37:42,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 1080 transitions, 20866 flow [2022-12-12 21:37:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:37:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:37:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2022-12-12 21:37:42,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-12 21:37:42,669 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -4 predicate places. [2022-12-12 21:37:42,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 1080 transitions, 20866 flow [2022-12-12 21:37:42,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 872 transitions, 16689 flow [2022-12-12 21:37:42,830 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 872 transitions, 16689 flow [2022-12-12 21:37:42,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 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-12 21:37:42,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:42,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:42,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:37:42,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -671912543, now seen corresponding path program 3 times [2022-12-12 21:37:42,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404462225] [2022-12-12 21:37:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:43,116 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-12 21:37:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:43,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404462225] [2022-12-12 21:37:43,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404462225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:43,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:43,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:37:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504378943] [2022-12-12 21:37:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:37:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:37:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:37:43,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 78 [2022-12-12 21:37:43,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 872 transitions, 16689 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-12 21:37:43,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:43,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 78 [2022-12-12 21:37:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:46,071 INFO L130 PetriNetUnfolder]: 13116/20048 cut-off events. [2022-12-12 21:37:46,071 INFO L131 PetriNetUnfolder]: For 114381/118594 co-relation queries the response was YES. [2022-12-12 21:37:46,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186728 conditions, 20048 events. 13116/20048 cut-off events. For 114381/118594 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 130347 event pairs, 259 based on Foata normal form. 2247/18684 useless extension candidates. Maximal degree in co-relation 186689. Up to 16649 conditions per place. [2022-12-12 21:37:46,183 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 192 selfloop transitions, 189 changer transitions 442/855 dead transitions. [2022-12-12 21:37:46,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 855 transitions, 17933 flow [2022-12-12 21:37:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-12-12 21:37:46,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2022-12-12 21:37:46,185 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2022-12-12 21:37:46,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 855 transitions, 17933 flow [2022-12-12 21:37:46,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 413 transitions, 8472 flow [2022-12-12 21:37:46,257 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 413 transitions, 8472 flow [2022-12-12 21:37:46,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-12 21:37:46,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:46,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:46,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:37:46,258 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 69187689, now seen corresponding path program 1 times [2022-12-12 21:37:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:46,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557227613] [2022-12-12 21:37:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:46,486 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-12 21:37:46,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:46,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557227613] [2022-12-12 21:37:46,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557227613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:46,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:46,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:46,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666415502] [2022-12-12 21:37:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:46,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:46,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 21:37:46,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 413 transitions, 8472 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-12 21:37:46,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:46,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 21:37:46,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:48,804 INFO L130 PetriNetUnfolder]: 11924/18511 cut-off events. [2022-12-12 21:37:48,805 INFO L131 PetriNetUnfolder]: For 68476/69890 co-relation queries the response was YES. [2022-12-12 21:37:48,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187858 conditions, 18511 events. 11924/18511 cut-off events. For 68476/69890 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 125334 event pairs, 224 based on Foata normal form. 224/14890 useless extension candidates. Maximal degree in co-relation 187816. Up to 16290 conditions per place. [2022-12-12 21:37:48,951 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 368 selfloop transitions, 12 changer transitions 352/754 dead transitions. [2022-12-12 21:37:48,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 754 transitions, 17164 flow [2022-12-12 21:37:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-12 21:37:48,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30128205128205127 [2022-12-12 21:37:48,965 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2022-12-12 21:37:48,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 754 transitions, 17164 flow [2022-12-12 21:37:49,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 402 transitions, 9060 flow [2022-12-12 21:37:49,167 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 402 transitions, 9060 flow [2022-12-12 21:37:49,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-12 21:37:49,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:49,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:37:49,167 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1502220133, now seen corresponding path program 1 times [2022-12-12 21:37:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:49,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913477375] [2022-12-12 21:37:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:49,419 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-12 21:37:49,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:49,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913477375] [2022-12-12 21:37:49,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913477375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:49,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:49,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:49,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538945171] [2022-12-12 21:37:49,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:49,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:49,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:49,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:49,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 21:37:49,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 402 transitions, 9060 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12 21:37:49,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:49,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 21:37:49,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:51,417 INFO L130 PetriNetUnfolder]: 9463/15269 cut-off events. [2022-12-12 21:37:51,418 INFO L131 PetriNetUnfolder]: For 65103/66384 co-relation queries the response was YES. [2022-12-12 21:37:51,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168289 conditions, 15269 events. 9463/15269 cut-off events. For 65103/66384 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 106597 event pairs, 134 based on Foata normal form. 216/12109 useless extension candidates. Maximal degree in co-relation 168244. Up to 13921 conditions per place. [2022-12-12 21:37:51,499 INFO L137 encePairwiseOnDemand]: 72/78 looper letters, 207 selfloop transitions, 3 changer transitions 459/690 dead transitions. [2022-12-12 21:37:51,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 690 transitions, 17100 flow [2022-12-12 21:37:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-12-12 21:37:51,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3162393162393162 [2022-12-12 21:37:51,501 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2022-12-12 21:37:51,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 690 transitions, 17100 flow [2022-12-12 21:37:51,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 231 transitions, 5546 flow [2022-12-12 21:37:51,546 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 231 transitions, 5546 flow [2022-12-12 21:37:51,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12 21:37:51,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:51,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:37:51,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash 673310241, now seen corresponding path program 2 times [2022-12-12 21:37:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:51,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954951120] [2022-12-12 21:37:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:52,667 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-12 21:37:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954951120] [2022-12-12 21:37:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954951120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:52,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:52,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:37:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029699542] [2022-12-12 21:37:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:52,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:37:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:37:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:37:52,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2022-12-12 21:37:52,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 231 transitions, 5546 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 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-12 21:37:52,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:52,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2022-12-12 21:37:52,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:53,870 INFO L130 PetriNetUnfolder]: 4938/8282 cut-off events. [2022-12-12 21:37:53,870 INFO L131 PetriNetUnfolder]: For 45900/46722 co-relation queries the response was YES. [2022-12-12 21:37:53,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98298 conditions, 8282 events. 4938/8282 cut-off events. For 45900/46722 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 55751 event pairs, 27 based on Foata normal form. 119/6436 useless extension candidates. Maximal degree in co-relation 98250. Up to 7886 conditions per place. [2022-12-12 21:37:53,914 INFO L137 encePairwiseOnDemand]: 71/78 looper letters, 184 selfloop transitions, 10 changer transitions 127/346 dead transitions. [2022-12-12 21:37:53,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 346 transitions, 9170 flow [2022-12-12 21:37:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:37:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:37:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2022-12-12 21:37:53,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.315018315018315 [2022-12-12 21:37:53,916 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2022-12-12 21:37:53,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 346 transitions, 9170 flow [2022-12-12 21:37:53,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 219 transitions, 5667 flow [2022-12-12 21:37:53,948 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 219 transitions, 5667 flow [2022-12-12 21:37:53,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 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-12 21:37:53,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:53,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:53,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:37:53,949 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1120436515, now seen corresponding path program 2 times [2022-12-12 21:37:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:53,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215905953] [2022-12-12 21:37:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:53,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:37:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:54,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:37:54,029 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:37:54,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:37:54,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:37:54,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:37:54,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:37:54,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:37:54,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:37:54,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:37:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:37:54,032 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:54,036 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:37:54,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:37:54,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:37:54 BasicIcfg [2022-12-12 21:37:54,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:37:54,119 INFO L158 Benchmark]: Toolchain (without parser) took 57684.94ms. Allocated memory was 188.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 162.6MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 21:37:54,119 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:37:54,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.73ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 134.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 21:37:54,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.80ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:54,120 INFO L158 Benchmark]: Boogie Preprocessor took 48.06ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:54,120 INFO L158 Benchmark]: RCFGBuilder took 673.34ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 90.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-12 21:37:54,120 INFO L158 Benchmark]: TraceAbstraction took 56425.78ms. Allocated memory was 188.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 89.7MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-12 21:37:54,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.73ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 134.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.80ms. Allocated memory is still 188.7MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.06ms. Allocated memory is still 188.7MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 673.34ms. Allocated memory is still 188.7MB. Free memory was 129.0MB in the beginning and 90.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 56425.78ms. Allocated memory was 188.7MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 89.7MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 140 PlacesBefore, 91 PlacesAfterwards, 129 TransitionsBefore, 78 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 4 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 4498, independent unconditional: 0, dependent: 224, dependent conditional: 224, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2969, independent: 2888, independent conditional: 0, independent unconditional: 2888, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2969, independent: 2850, independent conditional: 0, independent unconditional: 2850, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 119, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 605, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 550, dependent conditional: 0, dependent unconditional: 550, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4722, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 2969, unknown conditional: 0, unknown unconditional: 2969] , Statistics on independence cache: Total cache size (in pairs): 4674, Positive cache size: 4593, Positive conditional cache size: 0, Positive unconditional cache size: 4593, Negative cache size: 81, Negative conditional cache size: 0, Negative unconditional cache size: 81, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=-1, t993={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=0, t993={5:0}, t994={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=1, t993={5:0}, t994={6:0}, t995={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=2, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: 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: 865]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 772 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1703 IncrementalHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 48 mSDtfsCounter, 1703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16689occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 38219 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 3771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12 21:37:54,159 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...