/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:40:32,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:40:32,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:40:32,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:40:32,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:40:32,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:40:32,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:40:32,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:40:32,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:40:32,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:40:32,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:40:32,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:40:32,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:40:32,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:40:32,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:40:32,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:40:32,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:40:32,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:40:32,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:40:32,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:40:32,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:40:32,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:40:32,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:40:32,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:40:32,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:40:32,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:40:32,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:40:32,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:40:32,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:40:32,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:40:32,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:40:32,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:40:32,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:40:32,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:40:32,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:40:32,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:40:32,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:40:32,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:40:32,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:40:32,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:40:32,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:40:32,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:40:32,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:40:32,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:40:32,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:40:32,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:40:32,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:40:32,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:40:32,929 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:40:32,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:40:32,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:40:32,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:40:32,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:40:32,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:40:32,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:40:32,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:40:32,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:32,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:40:32,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:40:32,932 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-12 14:40:33,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:40:33,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:40:33,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:40:33,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:40:33,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:40:33,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-12 14:40:34,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:40:34,297 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:40:34,297 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-12 14:40:34,307 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0f0a8e2/887b3c9f89c3408db390e2fa05420db4/FLAGb7b4433b9 [2022-12-12 14:40:34,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0f0a8e2/887b3c9f89c3408db390e2fa05420db4 [2022-12-12 14:40:34,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:40:34,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:40:34,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:34,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:40:34,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:40:34,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f34c610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34, skipping insertion in model container [2022-12-12 14:40:34,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:40:34,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:40:34,452 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-12 14:40:34,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:34,621 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:40:34,630 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-12 14:40:34,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:34,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:34,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:34,701 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:40:34,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34 WrapperNode [2022-12-12 14:40:34,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:34,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:34,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:40:34,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:40:34,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,762 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 14:40:34,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:34,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:40:34,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:40:34,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:40:34,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:40:34,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:40:34,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:40:34,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:40:34,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (1/1) ... [2022-12-12 14:40:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:40:34,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 14:40:34,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:40:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:40:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:40:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:40:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:40:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:40:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:40:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:40:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:40:34,867 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:40:35,024 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:40:35,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:40:35,264 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:40:35,394 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:40:35,395 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:40:35,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:35 BoogieIcfgContainer [2022-12-12 14:40:35,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:40:35,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:40:35,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:40:35,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:40:35,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:40:34" (1/3) ... [2022-12-12 14:40:35,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a46d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:35, skipping insertion in model container [2022-12-12 14:40:35,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:34" (2/3) ... [2022-12-12 14:40:35,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a46d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:35, skipping insertion in model container [2022-12-12 14:40:35,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:35" (3/3) ... [2022-12-12 14:40:35,402 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-12 14:40:35,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:40:35,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:40:35,417 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:40:35,468 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:40:35,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 14:40:35,553 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 14:40:35,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:35,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 14:40:35,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 14:40:35,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-12 14:40:35,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:40:35,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 14:40:35,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-12 14:40:35,628 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 14:40:35,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 14:40:35,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 14:40:35,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-12 14:40:40,292 INFO L241 LiptonReduction]: Total number of compositions: 81 [2022-12-12 14:40:40,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:40:40,307 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;@3fb6611f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:40:40,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:40:40,309 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 14:40:40,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:40,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:40,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 14:40:40,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash 485890, now seen corresponding path program 1 times [2022-12-12 14:40:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:40,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500205191] [2022-12-12 14:40:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:40,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500205191] [2022-12-12 14:40:40,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500205191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:40,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:40,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126703416] [2022-12-12 14:40:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:40,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:40,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-12 14:40:40,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:40,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:40,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-12 14:40:40,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:41,702 INFO L130 PetriNetUnfolder]: 7640/12359 cut-off events. [2022-12-12 14:40:41,703 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-12 14:40:41,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23372 conditions, 12359 events. 7640/12359 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 93730 event pairs, 1000 based on Foata normal form. 0/7794 useless extension candidates. Maximal degree in co-relation 23361. Up to 9285 conditions per place. [2022-12-12 14:40:41,742 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 34 selfloop transitions, 2 changer transitions 60/107 dead transitions. [2022-12-12 14:40:41,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 417 flow [2022-12-12 14:40:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-12 14:40:41,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2022-12-12 14:40:41,752 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 140 transitions. [2022-12-12 14:40:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 417 flow [2022-12-12 14:40:41,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 412 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:41,756 INFO L231 Difference]: Finished difference. Result has 72 places, 32 transitions, 74 flow [2022-12-12 14:40:41,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=72, PETRI_TRANSITIONS=32} [2022-12-12 14:40:41,760 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-12 14:40:41,760 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 32 transitions, 74 flow [2022-12-12 14:40:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:41,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:41,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:40:41,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1527177077, now seen corresponding path program 1 times [2022-12-12 14:40:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355370636] [2022-12-12 14:40:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:42,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355370636] [2022-12-12 14:40:42,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355370636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:42,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:42,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594089329] [2022-12-12 14:40:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:42,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:42,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-12 14:40:42,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:42,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:42,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-12 14:40:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:42,708 INFO L130 PetriNetUnfolder]: 1836/2838 cut-off events. [2022-12-12 14:40:42,708 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-12 14:40:42,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2838 events. 1836/2838 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14320 event pairs, 346 based on Foata normal form. 55/2451 useless extension candidates. Maximal degree in co-relation 5732. Up to 2086 conditions per place. [2022-12-12 14:40:42,723 INFO L137 encePairwiseOnDemand]: 58/67 looper letters, 37 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2022-12-12 14:40:42,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 210 flow [2022-12-12 14:40:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 14:40:42,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33955223880597013 [2022-12-12 14:40:42,726 INFO L175 Difference]: Start difference. First operand has 72 places, 32 transitions, 74 flow. Second operand 4 states and 91 transitions. [2022-12-12 14:40:42,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 210 flow [2022-12-12 14:40:42,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:42,729 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 130 flow [2022-12-12 14:40:42,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-12 14:40:42,729 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -30 predicate places. [2022-12-12 14:40:42,729 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 130 flow [2022-12-12 14:40:42,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:42,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:42,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:40:42,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 97849925, now seen corresponding path program 1 times [2022-12-12 14:40:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872613583] [2022-12-12 14:40:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:42,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872613583] [2022-12-12 14:40:42,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872613583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:42,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:42,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216218666] [2022-12-12 14:40:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:42,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:42,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:42,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:42,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:42,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:43,089 INFO L130 PetriNetUnfolder]: 1475/2390 cut-off events. [2022-12-12 14:40:43,090 INFO L131 PetriNetUnfolder]: For 1127/1143 co-relation queries the response was YES. [2022-12-12 14:40:43,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6145 conditions, 2390 events. 1475/2390 cut-off events. For 1127/1143 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12846 event pairs, 706 based on Foata normal form. 8/1986 useless extension candidates. Maximal degree in co-relation 6132. Up to 2114 conditions per place. [2022-12-12 14:40:43,103 INFO L137 encePairwiseOnDemand]: 63/67 looper letters, 38 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-12-12 14:40:43,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 262 flow [2022-12-12 14:40:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-12 14:40:43,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3582089552238806 [2022-12-12 14:40:43,108 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 130 flow. Second operand 3 states and 72 transitions. [2022-12-12 14:40:43,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 262 flow [2022-12-12 14:40:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:43,112 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 162 flow [2022-12-12 14:40:43,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-12 14:40:43,113 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-12 14:40:43,113 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 162 flow [2022-12-12 14:40:43,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:43,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:43,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:43,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:40:43,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1260065355, now seen corresponding path program 1 times [2022-12-12 14:40:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:43,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112393878] [2022-12-12 14:40:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112393878] [2022-12-12 14:40:43,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112393878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:43,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:43,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919082944] [2022-12-12 14:40:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:43,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:43,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:43,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:43,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 14:40:43,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:43,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:43,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 14:40:43,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:43,947 INFO L130 PetriNetUnfolder]: 2930/4567 cut-off events. [2022-12-12 14:40:43,947 INFO L131 PetriNetUnfolder]: For 3324/3324 co-relation queries the response was YES. [2022-12-12 14:40:43,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12017 conditions, 4567 events. 2930/4567 cut-off events. For 3324/3324 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25489 event pairs, 558 based on Foata normal form. 170/4022 useless extension candidates. Maximal degree in co-relation 12002. Up to 1712 conditions per place. [2022-12-12 14:40:43,968 INFO L137 encePairwiseOnDemand]: 58/67 looper letters, 47 selfloop transitions, 8 changer transitions 20/83 dead transitions. [2022-12-12 14:40:43,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 459 flow [2022-12-12 14:40:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-12-12 14:40:43,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3402985074626866 [2022-12-12 14:40:43,970 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 162 flow. Second operand 5 states and 114 transitions. [2022-12-12 14:40:43,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 459 flow [2022-12-12 14:40:43,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:43,973 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 168 flow [2022-12-12 14:40:43,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-12 14:40:43,974 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-12 14:40:43,974 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 168 flow [2022-12-12 14:40:43,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:43,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:43,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:43,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:40:43,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1926084804, now seen corresponding path program 1 times [2022-12-12 14:40:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:43,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531070470] [2022-12-12 14:40:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:44,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:44,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531070470] [2022-12-12 14:40:44,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531070470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:44,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:44,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355273645] [2022-12-12 14:40:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:44,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:44,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:44,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:44,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:44,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:44,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:44,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:44,391 INFO L130 PetriNetUnfolder]: 1346/2164 cut-off events. [2022-12-12 14:40:44,391 INFO L131 PetriNetUnfolder]: For 2745/2793 co-relation queries the response was YES. [2022-12-12 14:40:44,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 2164 events. 1346/2164 cut-off events. For 2745/2793 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10771 event pairs, 755 based on Foata normal form. 40/1843 useless extension candidates. Maximal degree in co-relation 6256. Up to 1901 conditions per place. [2022-12-12 14:40:44,403 INFO L137 encePairwiseOnDemand]: 63/67 looper letters, 37 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-12 14:40:44,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 292 flow [2022-12-12 14:40:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-12 14:40:44,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3582089552238806 [2022-12-12 14:40:44,405 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 168 flow. Second operand 3 states and 72 transitions. [2022-12-12 14:40:44,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 292 flow [2022-12-12 14:40:44,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 266 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-12 14:40:44,409 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 163 flow [2022-12-12 14:40:44,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-12 14:40:44,411 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2022-12-12 14:40:44,411 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 163 flow [2022-12-12 14:40:44,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:44,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:44,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:44,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:40:44,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 9332765, now seen corresponding path program 1 times [2022-12-12 14:40:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:44,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037010059] [2022-12-12 14:40:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:44,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037010059] [2022-12-12 14:40:44,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037010059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:44,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438387184] [2022-12-12 14:40:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:44,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:44,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:44,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:44,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:44,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:44,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:45,161 INFO L130 PetriNetUnfolder]: 1424/2298 cut-off events. [2022-12-12 14:40:45,161 INFO L131 PetriNetUnfolder]: For 2052/2106 co-relation queries the response was YES. [2022-12-12 14:40:45,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 2298 events. 1424/2298 cut-off events. For 2052/2106 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11825 event pairs, 493 based on Foata normal form. 44/1970 useless extension candidates. Maximal degree in co-relation 6422. Up to 1869 conditions per place. [2022-12-12 14:40:45,174 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 48 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-12 14:40:45,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 377 flow [2022-12-12 14:40:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-12 14:40:45,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3619402985074627 [2022-12-12 14:40:45,176 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 163 flow. Second operand 4 states and 97 transitions. [2022-12-12 14:40:45,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 377 flow [2022-12-12 14:40:45,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:45,178 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 218 flow [2022-12-12 14:40:45,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-12 14:40:45,179 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -22 predicate places. [2022-12-12 14:40:45,179 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 218 flow [2022-12-12 14:40:45,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:45,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:45,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:40:45,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -489964182, now seen corresponding path program 1 times [2022-12-12 14:40:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188847944] [2022-12-12 14:40:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188847944] [2022-12-12 14:40:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188847944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574173339] [2022-12-12 14:40:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:45,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:45,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:45,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:45,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:45,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:45,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:45,566 INFO L130 PetriNetUnfolder]: 1447/2337 cut-off events. [2022-12-12 14:40:45,566 INFO L131 PetriNetUnfolder]: For 3307/3358 co-relation queries the response was YES. [2022-12-12 14:40:45,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7241 conditions, 2337 events. 1447/2337 cut-off events. For 3307/3358 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11927 event pairs, 618 based on Foata normal form. 42/2004 useless extension candidates. Maximal degree in co-relation 7222. Up to 1864 conditions per place. [2022-12-12 14:40:45,578 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-12 14:40:45,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 414 flow [2022-12-12 14:40:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-12 14:40:45,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35074626865671643 [2022-12-12 14:40:45,579 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 218 flow. Second operand 4 states and 94 transitions. [2022-12-12 14:40:45,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 414 flow [2022-12-12 14:40:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:45,584 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 253 flow [2022-12-12 14:40:45,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-12 14:40:45,584 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-12 14:40:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 253 flow [2022-12-12 14:40:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:45,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:45,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:40:45,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -490031142, now seen corresponding path program 2 times [2022-12-12 14:40:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:45,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602706747] [2022-12-12 14:40:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:45,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602706747] [2022-12-12 14:40:45,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602706747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:45,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:45,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74599994] [2022-12-12 14:40:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:45,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:45,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:45,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:45,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:45,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:45,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:45,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:46,095 INFO L130 PetriNetUnfolder]: 1412/2290 cut-off events. [2022-12-12 14:40:46,096 INFO L131 PetriNetUnfolder]: For 4452/4503 co-relation queries the response was YES. [2022-12-12 14:40:46,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 2290 events. 1412/2290 cut-off events. For 4452/4503 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11757 event pairs, 598 based on Foata normal form. 57/1979 useless extension candidates. Maximal degree in co-relation 7530. Up to 1851 conditions per place. [2022-12-12 14:40:46,107 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 48 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2022-12-12 14:40:46,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 449 flow [2022-12-12 14:40:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-12 14:40:46,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35074626865671643 [2022-12-12 14:40:46,108 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 253 flow. Second operand 4 states and 94 transitions. [2022-12-12 14:40:46,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 449 flow [2022-12-12 14:40:46,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 434 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:46,112 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 301 flow [2022-12-12 14:40:46,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-12 14:40:46,113 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-12 14:40:46,113 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 301 flow [2022-12-12 14:40:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:46,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:46,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:46,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:40:46,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1991006035, now seen corresponding path program 1 times [2022-12-12 14:40:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:46,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462835653] [2022-12-12 14:40:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:46,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462835653] [2022-12-12 14:40:46,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462835653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:46,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:46,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645051500] [2022-12-12 14:40:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:46,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:46,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:46,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:46,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:46,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:46,784 INFO L130 PetriNetUnfolder]: 1467/2365 cut-off events. [2022-12-12 14:40:46,785 INFO L131 PetriNetUnfolder]: For 6522/6598 co-relation queries the response was YES. [2022-12-12 14:40:46,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 2365 events. 1467/2365 cut-off events. For 6522/6598 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12192 event pairs, 449 based on Foata normal form. 62/2055 useless extension candidates. Maximal degree in co-relation 8345. Up to 1706 conditions per place. [2022-12-12 14:40:46,797 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 58 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2022-12-12 14:40:46,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 593 flow [2022-12-12 14:40:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-12 14:40:46,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3492537313432836 [2022-12-12 14:40:46,799 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 301 flow. Second operand 5 states and 117 transitions. [2022-12-12 14:40:46,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 593 flow [2022-12-12 14:40:46,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 580 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:46,804 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 363 flow [2022-12-12 14:40:46,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2022-12-12 14:40:46,805 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -12 predicate places. [2022-12-12 14:40:46,805 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 363 flow [2022-12-12 14:40:46,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:46,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:46,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:46,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:40:46,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1232755879, now seen corresponding path program 1 times [2022-12-12 14:40:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:46,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491923773] [2022-12-12 14:40:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:47,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491923773] [2022-12-12 14:40:47,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491923773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:47,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:47,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668397169] [2022-12-12 14:40:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:47,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:47,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:47,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:47,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:47,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:47,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:47,294 INFO L130 PetriNetUnfolder]: 1504/2429 cut-off events. [2022-12-12 14:40:47,294 INFO L131 PetriNetUnfolder]: For 8394/8441 co-relation queries the response was YES. [2022-12-12 14:40:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 2429 events. 1504/2429 cut-off events. For 8394/8441 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12500 event pairs, 583 based on Foata normal form. 42/2096 useless extension candidates. Maximal degree in co-relation 9216. Up to 1947 conditions per place. [2022-12-12 14:40:47,307 INFO L137 encePairwiseOnDemand]: 59/67 looper letters, 56 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2022-12-12 14:40:47,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 637 flow [2022-12-12 14:40:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 14:40:47,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33432835820895523 [2022-12-12 14:40:47,309 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 363 flow. Second operand 5 states and 112 transitions. [2022-12-12 14:40:47,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 637 flow [2022-12-12 14:40:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 614 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:47,316 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 454 flow [2022-12-12 14:40:47,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2022-12-12 14:40:47,317 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -10 predicate places. [2022-12-12 14:40:47,317 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 454 flow [2022-12-12 14:40:47,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:47,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:47,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:47,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:40:47,318 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1988863501, now seen corresponding path program 2 times [2022-12-12 14:40:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:47,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019852048] [2022-12-12 14:40:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019852048] [2022-12-12 14:40:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019852048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536204844] [2022-12-12 14:40:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:47,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:47,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:47,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:47,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:47,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:47,812 INFO L130 PetriNetUnfolder]: 1518/2456 cut-off events. [2022-12-12 14:40:47,812 INFO L131 PetriNetUnfolder]: For 10927/10974 co-relation queries the response was YES. [2022-12-12 14:40:47,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9991 conditions, 2456 events. 1518/2456 cut-off events. For 10927/10974 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12718 event pairs, 583 based on Foata normal form. 46/2125 useless extension candidates. Maximal degree in co-relation 9965. Up to 1955 conditions per place. [2022-12-12 14:40:47,825 INFO L137 encePairwiseOnDemand]: 59/67 looper letters, 58 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2022-12-12 14:40:47,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 752 flow [2022-12-12 14:40:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 14:40:47,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33432835820895523 [2022-12-12 14:40:47,827 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 454 flow. Second operand 5 states and 112 transitions. [2022-12-12 14:40:47,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 752 flow [2022-12-12 14:40:47,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 706 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:47,833 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 538 flow [2022-12-12 14:40:47,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2022-12-12 14:40:47,833 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2022-12-12 14:40:47,834 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 538 flow [2022-12-12 14:40:47,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:47,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:47,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:47,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:40:47,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1234831639, now seen corresponding path program 3 times [2022-12-12 14:40:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:47,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378147935] [2022-12-12 14:40:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378147935] [2022-12-12 14:40:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378147935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:48,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:48,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649389439] [2022-12-12 14:40:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:48,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:48,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:48,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:48,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:48,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:48,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:48,443 INFO L130 PetriNetUnfolder]: 1521/2461 cut-off events. [2022-12-12 14:40:48,443 INFO L131 PetriNetUnfolder]: For 13345/13392 co-relation queries the response was YES. [2022-12-12 14:40:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 2461 events. 1521/2461 cut-off events. For 13345/13392 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12750 event pairs, 581 based on Foata normal form. 42/2125 useless extension candidates. Maximal degree in co-relation 10448. Up to 1966 conditions per place. [2022-12-12 14:40:48,457 INFO L137 encePairwiseOnDemand]: 59/67 looper letters, 61 selfloop transitions, 22 changer transitions 0/95 dead transitions. [2022-12-12 14:40:48,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 852 flow [2022-12-12 14:40:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 14:40:48,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33432835820895523 [2022-12-12 14:40:48,458 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 538 flow. Second operand 5 states and 112 transitions. [2022-12-12 14:40:48,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 852 flow [2022-12-12 14:40:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 800 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:48,466 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 622 flow [2022-12-12 14:40:48,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=622, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-12 14:40:48,466 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2022-12-12 14:40:48,467 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 622 flow [2022-12-12 14:40:48,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:48,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:48,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:48,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:40:48,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 423504638, now seen corresponding path program 1 times [2022-12-12 14:40:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:48,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256394913] [2022-12-12 14:40:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:48,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256394913] [2022-12-12 14:40:48,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256394913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:48,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:48,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116113146] [2022-12-12 14:40:48,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:48,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:48,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:48,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:48,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:48,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 14:40:48,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:48,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:48,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 14:40:48,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:48,824 INFO L130 PetriNetUnfolder]: 1963/3072 cut-off events. [2022-12-12 14:40:48,825 INFO L131 PetriNetUnfolder]: For 25195/25310 co-relation queries the response was YES. [2022-12-12 14:40:48,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 3072 events. 1963/3072 cut-off events. For 25195/25310 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16379 event pairs, 507 based on Foata normal form. 107/2314 useless extension candidates. Maximal degree in co-relation 14066. Up to 2791 conditions per place. [2022-12-12 14:40:48,841 INFO L137 encePairwiseOnDemand]: 56/67 looper letters, 82 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-12-12 14:40:48,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 1011 flow [2022-12-12 14:40:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-12 14:40:48,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3681592039800995 [2022-12-12 14:40:48,842 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 622 flow. Second operand 3 states and 74 transitions. [2022-12-12 14:40:48,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 1011 flow [2022-12-12 14:40:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 961 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:48,851 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 590 flow [2022-12-12 14:40:48,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2022-12-12 14:40:48,851 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2022-12-12 14:40:48,852 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 590 flow [2022-12-12 14:40:48,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:48,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:48,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:40:48,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -217598823, now seen corresponding path program 1 times [2022-12-12 14:40:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900125755] [2022-12-12 14:40:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:48,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900125755] [2022-12-12 14:40:48,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900125755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:48,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:48,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931018111] [2022-12-12 14:40:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:48,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 14:40:48,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:48,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:48,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 14:40:48,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:49,147 INFO L130 PetriNetUnfolder]: 1012/1788 cut-off events. [2022-12-12 14:40:49,147 INFO L131 PetriNetUnfolder]: For 12694/12737 co-relation queries the response was YES. [2022-12-12 14:40:49,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8966 conditions, 1788 events. 1012/1788 cut-off events. For 12694/12737 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9868 event pairs, 135 based on Foata normal form. 139/1407 useless extension candidates. Maximal degree in co-relation 8937. Up to 1135 conditions per place. [2022-12-12 14:40:49,155 INFO L137 encePairwiseOnDemand]: 56/67 looper letters, 78 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2022-12-12 14:40:49,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 1028 flow [2022-12-12 14:40:49,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-12 14:40:49,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.373134328358209 [2022-12-12 14:40:49,157 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 590 flow. Second operand 4 states and 100 transitions. [2022-12-12 14:40:49,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 1028 flow [2022-12-12 14:40:49,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 920 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-12 14:40:49,166 INFO L231 Difference]: Finished difference. Result has 66 places, 76 transitions, 534 flow [2022-12-12 14:40:49,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=66, PETRI_TRANSITIONS=76} [2022-12-12 14:40:49,166 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2022-12-12 14:40:49,166 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 534 flow [2022-12-12 14:40:49,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:49,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:49,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:40:49,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -50523815, now seen corresponding path program 1 times [2022-12-12 14:40:49,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:49,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304878208] [2022-12-12 14:40:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:49,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304878208] [2022-12-12 14:40:49,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304878208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:49,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:49,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981836365] [2022-12-12 14:40:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:49,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:49,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 14:40:49,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 76 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:49,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:49,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 14:40:49,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:49,407 INFO L130 PetriNetUnfolder]: 580/1086 cut-off events. [2022-12-12 14:40:49,407 INFO L131 PetriNetUnfolder]: For 4090/4106 co-relation queries the response was YES. [2022-12-12 14:40:49,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 1086 events. 580/1086 cut-off events. For 4090/4106 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5621 event pairs, 45 based on Foata normal form. 106/843 useless extension candidates. Maximal degree in co-relation 5208. Up to 487 conditions per place. [2022-12-12 14:40:49,412 INFO L137 encePairwiseOnDemand]: 56/67 looper letters, 68 selfloop transitions, 28 changer transitions 0/108 dead transitions. [2022-12-12 14:40:49,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 986 flow [2022-12-12 14:40:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-12 14:40:49,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3283582089552239 [2022-12-12 14:40:49,413 INFO L175 Difference]: Start difference. First operand has 66 places, 76 transitions, 534 flow. Second operand 5 states and 110 transitions. [2022-12-12 14:40:49,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 986 flow [2022-12-12 14:40:49,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 908 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:49,419 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 530 flow [2022-12-12 14:40:49,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2022-12-12 14:40:49,419 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2022-12-12 14:40:49,420 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 530 flow [2022-12-12 14:40:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:49,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:49,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:49,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:40:49,420 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1540085294, now seen corresponding path program 1 times [2022-12-12 14:40:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393033684] [2022-12-12 14:40:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393033684] [2022-12-12 14:40:50,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393033684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:50,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:50,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:40:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082405763] [2022-12-12 14:40:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:50,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:40:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:40:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:40:50,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:50,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 530 flow. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:50,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:50,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:50,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:50,454 INFO L130 PetriNetUnfolder]: 844/1731 cut-off events. [2022-12-12 14:40:50,454 INFO L131 PetriNetUnfolder]: For 4858/5039 co-relation queries the response was YES. [2022-12-12 14:40:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7656 conditions, 1731 events. 844/1731 cut-off events. For 4858/5039 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11117 event pairs, 81 based on Foata normal form. 132/1517 useless extension candidates. Maximal degree in co-relation 7629. Up to 793 conditions per place. [2022-12-12 14:40:50,463 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 98 selfloop transitions, 15 changer transitions 31/162 dead transitions. [2022-12-12 14:40:50,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 162 transitions, 1463 flow [2022-12-12 14:40:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:40:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:40:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2022-12-12 14:40:50,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36318407960199006 [2022-12-12 14:40:50,465 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 530 flow. Second operand 6 states and 146 transitions. [2022-12-12 14:40:50,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 162 transitions, 1463 flow [2022-12-12 14:40:50,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 162 transitions, 1233 flow, removed 57 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:50,482 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 533 flow [2022-12-12 14:40:50,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2022-12-12 14:40:50,483 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2022-12-12 14:40:50,483 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 533 flow [2022-12-12 14:40:50,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:50,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:50,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:50,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:40:50,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1848669784, now seen corresponding path program 1 times [2022-12-12 14:40:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404965095] [2022-12-12 14:40:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:40:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404965095] [2022-12-12 14:40:51,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404965095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:51,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:51,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 14:40:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87095763] [2022-12-12 14:40:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:51,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 14:40:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 14:40:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-12 14:40:51,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 14:40:51,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 533 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:51,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:51,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 14:40:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:51,416 INFO L130 PetriNetUnfolder]: 684/1458 cut-off events. [2022-12-12 14:40:51,416 INFO L131 PetriNetUnfolder]: For 4228/4350 co-relation queries the response was YES. [2022-12-12 14:40:51,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1458 events. 684/1458 cut-off events. For 4228/4350 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9475 event pairs, 45 based on Foata normal form. 127/1287 useless extension candidates. Maximal degree in co-relation 5685. Up to 640 conditions per place. [2022-12-12 14:40:51,422 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 71 selfloop transitions, 16 changer transitions 33/138 dead transitions. [2022-12-12 14:40:51,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1117 flow [2022-12-12 14:40:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:40:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:40:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-12-12 14:40:51,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29850746268656714 [2022-12-12 14:40:51,424 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 533 flow. Second operand 8 states and 160 transitions. [2022-12-12 14:40:51,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1117 flow [2022-12-12 14:40:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 138 transitions, 1093 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:51,436 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 558 flow [2022-12-12 14:40:51,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2022-12-12 14:40:51,436 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2022-12-12 14:40:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 558 flow [2022-12-12 14:40:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:40:51,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:51,437 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 14:40:51,437 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -236909604, now seen corresponding path program 2 times [2022-12-12 14:40:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165684287] [2022-12-12 14:40:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:51,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:40:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:51,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:40:51,520 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:40:51,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:40:51,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:40:51,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:40:51,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:40:51,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:40:51,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:40:51,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 14:40:51,523 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:51,527 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:40:51,527 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:40:51,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:40:51 BasicIcfg [2022-12-12 14:40:51,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:40:51,579 INFO L158 Benchmark]: Toolchain (without parser) took 17259.27ms. Allocated memory was 215.0MB in the beginning and 665.8MB in the end (delta: 450.9MB). Free memory was 189.2MB in the beginning and 327.7MB in the end (delta: -138.5MB). Peak memory consumption was 312.7MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,579 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:40:51,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.83ms. Allocated memory is still 215.0MB. Free memory was 188.7MB in the beginning and 162.6MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory is still 215.0MB. Free memory was 162.6MB in the beginning and 160.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,580 INFO L158 Benchmark]: Boogie Preprocessor took 44.65ms. Allocated memory is still 215.0MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,580 INFO L158 Benchmark]: RCFGBuilder took 587.75ms. Allocated memory is still 215.0MB. Free memory was 158.0MB in the beginning and 122.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,580 INFO L158 Benchmark]: TraceAbstraction took 16180.88ms. Allocated memory was 215.0MB in the beginning and 665.8MB in the end (delta: 450.9MB). Free memory was 121.3MB in the beginning and 327.7MB in the end (delta: -206.4MB). Peak memory consumption was 245.6MB. Max. memory is 8.0GB. [2022-12-12 14:40:51,581 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.11ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 381.83ms. Allocated memory is still 215.0MB. Free memory was 188.7MB in the beginning and 162.6MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory is still 215.0MB. Free memory was 162.6MB in the beginning and 160.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.65ms. Allocated memory is still 215.0MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.75ms. Allocated memory is still 215.0MB. Free memory was 158.0MB in the beginning and 122.4MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16180.88ms. Allocated memory was 215.0MB in the beginning and 665.8MB in the end (delta: 450.9MB). Free memory was 121.3MB in the beginning and 327.7MB in the end (delta: -206.4MB). Peak memory consumption was 245.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 112 PlacesBefore, 75 PlacesAfterwards, 104 TransitionsBefore, 67 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 3293, independent unconditional: 0, dependent: 167, dependent conditional: 167, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1777, independent: 1727, independent conditional: 0, independent unconditional: 1727, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1777, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3460, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1777, unknown conditional: 0, unknown unconditional: 1777] , Statistics on independence cache: Total cache size (in pairs): 2993, Positive cache size: 2943, Positive conditional cache size: 0, Positive unconditional cache size: 2943, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-3, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-2, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 821]: 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: 819]: 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: 823]: 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, 134 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: 16.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1685 IncrementalHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 21 mSDtfsCounter, 1685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=12, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 2771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:40:51,603 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...