/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:23:00,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:23:00,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:23:00,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:23:00,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:23:00,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:23:00,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:23:00,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:23:00,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:23:00,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:23:00,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:23:00,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:23:00,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:23:00,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:23:00,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:23:00,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:23:00,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:23:00,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:23:00,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:23:00,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:23:00,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:23:00,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:23:00,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:23:00,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:23:00,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:23:00,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:23:00,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:23:00,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:23:00,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:23:00,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:23:00,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:23:00,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:23:00,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:23:00,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:23:00,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:23:00,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:23:00,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:23:00,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:23:00,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:23:00,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:23:00,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:23:00,876 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-05 20:23:00,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:23:00,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:23:00,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:23:00,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:23:00,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:23:00,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:23:00,906 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:23:00,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:23:00,906 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:23:00,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:23:00,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:23:00,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:23:00,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:23:00,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:23:00,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:23:00,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:23:00,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:00,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:23:00,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:23:00,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:23:00,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:23:00,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:23:00,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:23:00,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:23:01,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:23:01,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:23:01,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:23:01,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:23:01,250 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:23:01,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-05 20:23:02,417 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:23:02,690 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:23:02,690 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-05 20:23:02,712 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ec149e/6f78e4bec8784aab950ea51c9ec1a5bb/FLAG1e57ae2f4 [2022-12-05 20:23:02,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ec149e/6f78e4bec8784aab950ea51c9ec1a5bb [2022-12-05 20:23:02,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:23:02,735 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:23:02,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:02,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:23:02,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:23:02,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:02" (1/1) ... [2022-12-05 20:23:02,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593bbaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:02, skipping insertion in model container [2022-12-05 20:23:02,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:02" (1/1) ... [2022-12-05 20:23:02,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:23:02,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:23:02,926 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/mix038_tso.oepc.i[949,962] [2022-12-05 20:23:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:03,138 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:23:03,148 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/mix038_tso.oepc.i[949,962] [2022-12-05 20:23:03,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:03,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:03,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:03,232 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:23:03,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03 WrapperNode [2022-12-05 20:23:03,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:03,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:03,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:23:03,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:23:03,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,319 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 20:23:03,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:03,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:23:03,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:23:03,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:23:03,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:23:03,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:23:03,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:23:03,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:23:03,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (1/1) ... [2022-12-05 20:23:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:23:03,420 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-05 20:23:03,443 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-05 20:23:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:23:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:23:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:23:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:23:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:23:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:23:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:23:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:23:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:23:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:23:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:23:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:23:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:23:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:23:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:23:03,466 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:23:03,628 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:23:03,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:23:03,940 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:23:04,059 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:23:04,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:23:04,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:04 BoogieIcfgContainer [2022-12-05 20:23:04,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:23:04,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:23:04,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:23:04,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:23:04,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:23:02" (1/3) ... [2022-12-05 20:23:04,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346e6ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:04, skipping insertion in model container [2022-12-05 20:23:04,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:03" (2/3) ... [2022-12-05 20:23:04,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346e6ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:04, skipping insertion in model container [2022-12-05 20:23:04,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:04" (3/3) ... [2022-12-05 20:23:04,069 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-05 20:23:04,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:23:04,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:23:04,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:23:04,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:23:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:23:04,237 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:23:04,238 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:04,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:23:04,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:23:04,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:04,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:23:04,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:04,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:04,363 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:23:04,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:04,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:23:04,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:04,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-05 20:23:09,620 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-05 20:23:09,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:23:09,639 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;@f098c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:23:09,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:23:09,642 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:23:09,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:09,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:09,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:23:09,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 465488276, now seen corresponding path program 1 times [2022-12-05 20:23:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709970770] [2022-12-05 20:23:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:10,064 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-05 20:23:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:10,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709970770] [2022-12-05 20:23:10,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709970770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:10,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:10,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638734777] [2022-12-05 20:23:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:10,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:10,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:23:10,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:10,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:10,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:23:10,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:10,426 INFO L130 PetriNetUnfolder]: 1103/1790 cut-off events. [2022-12-05 20:23:10,426 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 20:23:10,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1790 events. 1103/1790 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9621 event pairs, 182 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 3466. Up to 1318 conditions per place. [2022-12-05 20:23:10,436 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 29 selfloop transitions, 2 changer transitions 6/40 dead transitions. [2022-12-05 20:23:10,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 166 flow [2022-12-05 20:23:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-05 20:23:10,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 20:23:10,448 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 51 transitions. [2022-12-05 20:23:10,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 166 flow [2022-12-05 20:23:10,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:10,452 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2022-12-05 20:23:10,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-05 20:23:10,457 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-05 20:23:10,457 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2022-12-05 20:23:10,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:10,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:10,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:10,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:23:10,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 659741765, now seen corresponding path program 1 times [2022-12-05 20:23:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:10,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874960438] [2022-12-05 20:23:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:10,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:10,919 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-05 20:23:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:10,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874960438] [2022-12-05 20:23:10,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874960438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:10,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:10,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619501481] [2022-12-05 20:23:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:10,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:10,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:23:10,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:10,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:10,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:23:10,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:11,189 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2022-12-05 20:23:11,190 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-05 20:23:11,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 1880 events. 1269/1880 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7484 event pairs, 429 based on Foata normal form. 50/1930 useless extension candidates. Maximal degree in co-relation 3936. Up to 1316 conditions per place. [2022-12-05 20:23:11,199 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-05 20:23:11,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 140 flow [2022-12-05 20:23:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 20:23:11,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:23:11,201 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 3 states and 33 transitions. [2022-12-05 20:23:11,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 140 flow [2022-12-05 20:23:11,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:11,203 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-05 20:23:11,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-05 20:23:11,204 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-05 20:23:11,204 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-05 20:23:11,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:11,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:11,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:11,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:23:11,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1641956004, now seen corresponding path program 1 times [2022-12-05 20:23:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:11,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869058432] [2022-12-05 20:23:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:11,682 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-05 20:23:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869058432] [2022-12-05 20:23:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869058432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:11,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:11,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356530325] [2022-12-05 20:23:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:11,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:23:11,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 20:23:11,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:11,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:23:11,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:11,870 INFO L130 PetriNetUnfolder]: 803/1273 cut-off events. [2022-12-05 20:23:11,871 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-05 20:23:11,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 1273 events. 803/1273 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5724 event pairs, 313 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 2709. Up to 1166 conditions per place. [2022-12-05 20:23:11,878 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 28 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 20:23:11,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 153 flow [2022-12-05 20:23:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-05 20:23:11,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-05 20:23:11,880 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 39 transitions. [2022-12-05 20:23:11,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 153 flow [2022-12-05 20:23:11,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:11,881 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 80 flow [2022-12-05 20:23:11,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-05 20:23:11,882 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-05 20:23:11,882 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 80 flow [2022-12-05 20:23:11,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 20:23:11,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:11,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:11,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:23:11,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash 638971378, now seen corresponding path program 1 times [2022-12-05 20:23:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:11,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488466909] [2022-12-05 20:23:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:12,247 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-05 20:23:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488466909] [2022-12-05 20:23:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488466909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:12,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:12,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151888775] [2022-12-05 20:23:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:12,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:23:12,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:12,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:12,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:23:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:12,480 INFO L130 PetriNetUnfolder]: 813/1301 cut-off events. [2022-12-05 20:23:12,480 INFO L131 PetriNetUnfolder]: For 279/303 co-relation queries the response was YES. [2022-12-05 20:23:12,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1301 events. 813/1301 cut-off events. For 279/303 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5891 event pairs, 305 based on Foata normal form. 25/1326 useless extension candidates. Maximal degree in co-relation 3034. Up to 1063 conditions per place. [2022-12-05 20:23:12,487 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2022-12-05 20:23:12,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 234 flow [2022-12-05 20:23:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-05 20:23:12,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-05 20:23:12,489 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 80 flow. Second operand 4 states and 54 transitions. [2022-12-05 20:23:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 234 flow [2022-12-05 20:23:12,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:12,491 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2022-12-05 20:23:12,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-05 20:23:12,492 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-05 20:23:12,492 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2022-12-05 20:23:12,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:12,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:12,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:12,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:23:12,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash -730584978, now seen corresponding path program 1 times [2022-12-05 20:23:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:12,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192180358] [2022-12-05 20:23:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:12,849 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-05 20:23:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:12,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192180358] [2022-12-05 20:23:12,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192180358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:12,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:12,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902502943] [2022-12-05 20:23:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:12,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:23:12,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 20:23:12,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:12,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:23:12,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:13,213 INFO L130 PetriNetUnfolder]: 1350/2005 cut-off events. [2022-12-05 20:23:13,213 INFO L131 PetriNetUnfolder]: For 1526/1526 co-relation queries the response was YES. [2022-12-05 20:23:13,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 2005 events. 1350/2005 cut-off events. For 1526/1526 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8335 event pairs, 359 based on Foata normal form. 12/2017 useless extension candidates. Maximal degree in co-relation 5507. Up to 1657 conditions per place. [2022-12-05 20:23:13,225 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 44 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-05 20:23:13,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 322 flow [2022-12-05 20:23:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:23:13,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-05 20:23:13,227 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:23:13,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 322 flow [2022-12-05 20:23:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 318 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 20:23:13,230 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 196 flow [2022-12-05 20:23:13,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-05 20:23:13,231 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2022-12-05 20:23:13,231 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 196 flow [2022-12-05 20:23:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 20:23:13,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:13,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:13,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:23:13,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2079144252, now seen corresponding path program 2 times [2022-12-05 20:23:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:13,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137340278] [2022-12-05 20:23:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:13,530 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-05 20:23:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:13,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137340278] [2022-12-05 20:23:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137340278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:13,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:13,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454541090] [2022-12-05 20:23:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:13,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:13,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:23:13,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-05 20:23:13,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:13,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:23:13,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:13,778 INFO L130 PetriNetUnfolder]: 917/1496 cut-off events. [2022-12-05 20:23:13,778 INFO L131 PetriNetUnfolder]: For 1985/1985 co-relation queries the response was YES. [2022-12-05 20:23:13,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 1496 events. 917/1496 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7072 event pairs, 259 based on Foata normal form. 14/1510 useless extension candidates. Maximal degree in co-relation 4512. Up to 1069 conditions per place. [2022-12-05 20:23:13,789 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 41 selfloop transitions, 14 changer transitions 0/58 dead transitions. [2022-12-05 20:23:13,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 385 flow [2022-12-05 20:23:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-05 20:23:13,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-05 20:23:13,790 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 196 flow. Second operand 4 states and 54 transitions. [2022-12-05 20:23:13,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 385 flow [2022-12-05 20:23:13,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:13,795 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 274 flow [2022-12-05 20:23:13,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-05 20:23:13,796 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-05 20:23:13,796 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 274 flow [2022-12-05 20:23:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-05 20:23:13,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:13,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:13,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:23:13,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1175915838, now seen corresponding path program 1 times [2022-12-05 20:23:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321655640] [2022-12-05 20:23:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:14,069 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-05 20:23:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:14,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321655640] [2022-12-05 20:23:14,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321655640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:14,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:14,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086258017] [2022-12-05 20:23:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:14,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:23:14,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:14,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:14,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:23:14,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:14,348 INFO L130 PetriNetUnfolder]: 958/1563 cut-off events. [2022-12-05 20:23:14,348 INFO L131 PetriNetUnfolder]: For 3401/3401 co-relation queries the response was YES. [2022-12-05 20:23:14,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5339 conditions, 1563 events. 958/1563 cut-off events. For 3401/3401 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7513 event pairs, 250 based on Foata normal form. 4/1567 useless extension candidates. Maximal degree in co-relation 5317. Up to 1088 conditions per place. [2022-12-05 20:23:14,360 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 47 selfloop transitions, 18 changer transitions 0/68 dead transitions. [2022-12-05 20:23:14,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 498 flow [2022-12-05 20:23:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-05 20:23:14,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-05 20:23:14,362 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 274 flow. Second operand 5 states and 65 transitions. [2022-12-05 20:23:14,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 498 flow [2022-12-05 20:23:14,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 478 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:14,370 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 326 flow [2022-12-05 20:23:14,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-05 20:23:14,371 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2022-12-05 20:23:14,371 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 326 flow [2022-12-05 20:23:14,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:14,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:14,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:14,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:23:14,372 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1204486368, now seen corresponding path program 2 times [2022-12-05 20:23:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501802883] [2022-12-05 20:23:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:15,042 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-05 20:23:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:15,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501802883] [2022-12-05 20:23:15,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501802883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:15,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:15,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:23:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159837184] [2022-12-05 20:23:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:15,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:23:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:23:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:23:15,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:23:15,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 326 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:15,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:15,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:23:15,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:15,479 INFO L130 PetriNetUnfolder]: 1614/2397 cut-off events. [2022-12-05 20:23:15,479 INFO L131 PetriNetUnfolder]: For 6542/6542 co-relation queries the response was YES. [2022-12-05 20:23:15,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8590 conditions, 2397 events. 1614/2397 cut-off events. For 6542/6542 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10671 event pairs, 216 based on Foata normal form. 24/2421 useless extension candidates. Maximal degree in co-relation 8566. Up to 1353 conditions per place. [2022-12-05 20:23:15,497 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 60 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2022-12-05 20:23:15,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 616 flow [2022-12-05 20:23:15,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-05 20:23:15,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 20:23:15,499 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 326 flow. Second operand 5 states and 63 transitions. [2022-12-05 20:23:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 616 flow [2022-12-05 20:23:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 572 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:15,508 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 365 flow [2022-12-05 20:23:15,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-05 20:23:15,508 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-05 20:23:15,509 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 365 flow [2022-12-05 20:23:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:15,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:15,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:23:15,509 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash -125949437, now seen corresponding path program 1 times [2022-12-05 20:23:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:15,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923332594] [2022-12-05 20:23:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:15,645 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-05 20:23:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923332594] [2022-12-05 20:23:15,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923332594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256547651] [2022-12-05 20:23:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:15,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:15,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-05 20:23:15,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:15,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:15,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-05 20:23:15,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:16,034 INFO L130 PetriNetUnfolder]: 1705/2696 cut-off events. [2022-12-05 20:23:16,036 INFO L131 PetriNetUnfolder]: For 9815/9831 co-relation queries the response was YES. [2022-12-05 20:23:16,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10054 conditions, 2696 events. 1705/2696 cut-off events. For 9815/9831 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13964 event pairs, 257 based on Foata normal form. 56/2738 useless extension candidates. Maximal degree in co-relation 10029. Up to 1336 conditions per place. [2022-12-05 20:23:16,062 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 68 selfloop transitions, 2 changer transitions 8/85 dead transitions. [2022-12-05 20:23:16,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 769 flow [2022-12-05 20:23:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:23:16,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 20:23:16,064 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 365 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:23:16,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 769 flow [2022-12-05 20:23:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 709 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:16,077 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 343 flow [2022-12-05 20:23:16,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-05 20:23:16,078 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-05 20:23:16,078 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 343 flow [2022-12-05 20:23:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:16,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:16,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:23:16,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 600609697, now seen corresponding path program 2 times [2022-12-05 20:23:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360215381] [2022-12-05 20:23:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:16,227 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-05 20:23:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:16,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360215381] [2022-12-05 20:23:16,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360215381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:16,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:16,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782258443] [2022-12-05 20:23:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:16,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:16,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:23:16,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:16,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:23:16,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:16,437 INFO L130 PetriNetUnfolder]: 763/1340 cut-off events. [2022-12-05 20:23:16,437 INFO L131 PetriNetUnfolder]: For 4066/4087 co-relation queries the response was YES. [2022-12-05 20:23:16,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1340 events. 763/1340 cut-off events. For 4066/4087 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7066 event pairs, 187 based on Foata normal form. 95/1411 useless extension candidates. Maximal degree in co-relation 4975. Up to 1007 conditions per place. [2022-12-05 20:23:16,449 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 58 selfloop transitions, 4 changer transitions 2/73 dead transitions. [2022-12-05 20:23:16,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 629 flow [2022-12-05 20:23:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 20:23:16,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-05 20:23:16,450 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 343 flow. Second operand 3 states and 43 transitions. [2022-12-05 20:23:16,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 629 flow [2022-12-05 20:23:16,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:16,458 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 368 flow [2022-12-05 20:23:16,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-05 20:23:16,460 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2022-12-05 20:23:16,460 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 368 flow [2022-12-05 20:23:16,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:16,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:16,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:23:16,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1509437149, now seen corresponding path program 1 times [2022-12-05 20:23:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:16,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142759004] [2022-12-05 20:23:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:16,601 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-05 20:23:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142759004] [2022-12-05 20:23:16,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142759004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:16,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:16,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574936352] [2022-12-05 20:23:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:16,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:16,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:23:16,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:16,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:23:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:16,745 INFO L130 PetriNetUnfolder]: 378/734 cut-off events. [2022-12-05 20:23:16,745 INFO L131 PetriNetUnfolder]: For 2184/2198 co-relation queries the response was YES. [2022-12-05 20:23:16,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 734 events. 378/734 cut-off events. For 2184/2198 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3685 event pairs, 76 based on Foata normal form. 91/812 useless extension candidates. Maximal degree in co-relation 2958. Up to 249 conditions per place. [2022-12-05 20:23:16,750 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 64 selfloop transitions, 7 changer transitions 5/85 dead transitions. [2022-12-05 20:23:16,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 744 flow [2022-12-05 20:23:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 20:23:16,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-05 20:23:16,751 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 368 flow. Second operand 4 states and 58 transitions. [2022-12-05 20:23:16,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 744 flow [2022-12-05 20:23:16,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:16,756 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 394 flow [2022-12-05 20:23:16,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-05 20:23:16,757 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2022-12-05 20:23:16,757 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 394 flow [2022-12-05 20:23:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:16,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:16,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:23:16,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -165247444, now seen corresponding path program 1 times [2022-12-05 20:23:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183076853] [2022-12-05 20:23:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:16,920 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-05 20:23:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:16,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183076853] [2022-12-05 20:23:16,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183076853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:16,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:16,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:16,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611400504] [2022-12-05 20:23:16,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:16,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:16,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:16,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:16,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:16,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 20:23:16,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:16,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:16,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 20:23:16,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:17,061 INFO L130 PetriNetUnfolder]: 327/624 cut-off events. [2022-12-05 20:23:17,061 INFO L131 PetriNetUnfolder]: For 2236/2250 co-relation queries the response was YES. [2022-12-05 20:23:17,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 624 events. 327/624 cut-off events. For 2236/2250 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3083 event pairs, 70 based on Foata normal form. 30/642 useless extension candidates. Maximal degree in co-relation 2590. Up to 249 conditions per place. [2022-12-05 20:23:17,065 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 47 selfloop transitions, 10 changer transitions 23/85 dead transitions. [2022-12-05 20:23:17,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 768 flow [2022-12-05 20:23:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-05 20:23:17,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2022-12-05 20:23:17,067 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 394 flow. Second operand 5 states and 61 transitions. [2022-12-05 20:23:17,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 768 flow [2022-12-05 20:23:17,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 705 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 20:23:17,075 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 272 flow [2022-12-05 20:23:17,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2022-12-05 20:23:17,077 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2022-12-05 20:23:17,077 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 272 flow [2022-12-05 20:23:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:17,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:17,077 INFO L213 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] [2022-12-05 20:23:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:23:17,077 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 575084906, now seen corresponding path program 1 times [2022-12-05 20:23:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412693263] [2022-12-05 20:23:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:17,413 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-05 20:23:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:17,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412693263] [2022-12-05 20:23:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412693263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:17,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:17,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188234667] [2022-12-05 20:23:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:17,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:17,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:23:17,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 272 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:17,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:17,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:23:17,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:17,680 INFO L130 PetriNetUnfolder]: 338/618 cut-off events. [2022-12-05 20:23:17,680 INFO L131 PetriNetUnfolder]: For 1608/1608 co-relation queries the response was YES. [2022-12-05 20:23:17,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 618 events. 338/618 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2552 event pairs, 67 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 2505. Up to 409 conditions per place. [2022-12-05 20:23:17,683 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 41 selfloop transitions, 3 changer transitions 46/90 dead transitions. [2022-12-05 20:23:17,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 745 flow [2022-12-05 20:23:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:23:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:23:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-05 20:23:17,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-05 20:23:17,685 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 272 flow. Second operand 6 states and 57 transitions. [2022-12-05 20:23:17,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 745 flow [2022-12-05 20:23:17,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 654 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-05 20:23:17,692 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 187 flow [2022-12-05 20:23:17,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-05 20:23:17,692 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2022-12-05 20:23:17,693 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 187 flow [2022-12-05 20:23:17,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:17,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:17,693 INFO L213 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] [2022-12-05 20:23:17,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:23:17,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -635354868, now seen corresponding path program 2 times [2022-12-05 20:23:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:17,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574666188] [2022-12-05 20:23:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:17,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:23:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:17,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:23:17,820 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:23:17,820 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:23:17,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:23:17,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:23:17,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:23:17,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:23:17,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:23:17,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:23:17,823 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:17,830 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:23:17,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:23:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:23:17 BasicIcfg [2022-12-05 20:23:17,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:23:17,907 INFO L158 Benchmark]: Toolchain (without parser) took 15171.62ms. Allocated memory was 183.5MB in the beginning and 499.1MB in the end (delta: 315.6MB). Free memory was 144.8MB in the beginning and 397.0MB in the end (delta: -252.2MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,907 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:23:17,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.71ms. Allocated memory is still 183.5MB. Free memory was 144.4MB in the beginning and 117.7MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.36ms. Allocated memory is still 183.5MB. Free memory was 117.7MB in the beginning and 158.6MB in the end (delta: -40.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,908 INFO L158 Benchmark]: Boogie Preprocessor took 58.72ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 156.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,908 INFO L158 Benchmark]: RCFGBuilder took 682.32ms. Allocated memory is still 183.5MB. Free memory was 156.9MB in the beginning and 121.3MB in the end (delta: 35.5MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,909 INFO L158 Benchmark]: TraceAbstraction took 13842.71ms. Allocated memory was 183.5MB in the beginning and 499.1MB in the end (delta: 315.6MB). Free memory was 120.8MB in the beginning and 397.0MB in the end (delta: -276.2MB). Peak memory consumption was 38.9MB. Max. memory is 8.0GB. [2022-12-05 20:23:17,910 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.14ms. Allocated memory is still 183.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.71ms. Allocated memory is still 183.5MB. Free memory was 144.4MB in the beginning and 117.7MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.36ms. Allocated memory is still 183.5MB. Free memory was 117.7MB in the beginning and 158.6MB in the end (delta: -40.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.72ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 156.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 682.32ms. Allocated memory is still 183.5MB. Free memory was 156.9MB in the beginning and 121.3MB in the end (delta: 35.5MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13842.71ms. Allocated memory was 183.5MB in the beginning and 499.1MB in the end (delta: 315.6MB). Free memory was 120.8MB in the beginning and 397.0MB in the end (delta: -276.2MB). Peak memory consumption was 38.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 117 PlacesBefore, 37 PlacesAfterwards, 109 TransitionsBefore, 28 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 1700, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1415, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1415, independent: 1332, independent conditional: 0, independent unconditional: 1332, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1796, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 1415, unknown conditional: 0, unknown unconditional: 1415] , Statistics on independence cache: Total cache size (in pairs): 2133, Positive cache size: 2089, Positive conditional cache size: 0, Positive unconditional cache size: 2089, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-1, t1019={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=0, t1019={5:0}, t1020={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=1, t1019={5:0}, t1020={6:0}, t1021={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L753] 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) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 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 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 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) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L808] 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) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 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) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 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 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 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) [L853] 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)) [L854] 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)) [L855] 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)) [L856] 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)) [L857] 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)) [L858] 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)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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: 831]: 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: 833]: 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: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 910 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 23 mSDtfsCounter, 910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=394occurred in iteration=11, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1468 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-05 20:23:17,937 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...