./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:01:34,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:01:34,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:01:34,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:01:34,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:01:34,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:01:34,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:01:34,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:01:34,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:01:34,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:01:34,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:01:34,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:01:34,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:01:34,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:01:34,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:01:34,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:01:34,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:01:34,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:01:34,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:01:34,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:01:34,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:01:34,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:01:34,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:01:34,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:01:34,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:01:34,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:01:34,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:01:34,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:01:34,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:01:34,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:01:34,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:01:34,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:01:34,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:01:34,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:01:34,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:01:34,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:01:34,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:01:34,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:01:34,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:01:34,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:01:34,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:01:34,831 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:01:34,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:01:34,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:01:34,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:01:34,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:01:34,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:01:34,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:01:34,870 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:01:34,870 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:01:34,870 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:01:34,871 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:01:34,872 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:01:34,872 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:01:34,872 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:01:34,873 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:01:34,873 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:01:34,873 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:01:34,873 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:01:34,874 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:01:34,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:01:34,875 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:01:34,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:01:34,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:01:34,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:01:34,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:01:34,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:01:34,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:01:34,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:01:34,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:01:34,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:01:34,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:01:34,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:01:34,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:01:34,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:01:34,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:01:34,879 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:01:34,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:01:34,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:01:34,880 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:01:34,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:01:34,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:01:34,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:01:34,881 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 [2022-11-03 02:01:35,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:01:35,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:01:35,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:01:35,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:01:35,261 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:01:35,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-03 02:01:35,331 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/data/93fc47a1d/023780d036fe4570815428b69d77f689/FLAG3d61a7b4d [2022-11-03 02:01:35,878 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:01:35,879 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-03 02:01:35,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/data/93fc47a1d/023780d036fe4570815428b69d77f689/FLAG3d61a7b4d [2022-11-03 02:01:36,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/data/93fc47a1d/023780d036fe4570815428b69d77f689 [2022-11-03 02:01:36,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:01:36,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:01:36,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:01:36,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:01:36,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:01:36,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719c682d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36, skipping insertion in model container [2022-11-03 02:01:36,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:01:36,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:01:36,510 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:01:36,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-03 02:01:36,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:01:36,739 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:01:36,777 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:01:36,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-03 02:01:36,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:01:36,841 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:01:36,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36 WrapperNode [2022-11-03 02:01:36,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:01:36,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:01:36,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:01:36,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:01:36,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,914 INFO L138 Inliner]: procedures = 176, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2022-11-03 02:01:36,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:01:36,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:01:36,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:01:36,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:01:36,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,955 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:01:36,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:01:36,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:01:36,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:01:36,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (1/1) ... [2022-11-03 02:01:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:01:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:37,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:01:37,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff2de66a-14b9-434a-87ab-a4ee865770ec/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:01:37,050 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-03 02:01:37,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-03 02:01:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:01:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:01:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:01:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:01:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:01:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:01:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:01:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:01:37,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:01:37,054 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:01:37,183 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:01:37,185 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:01:37,445 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:01:37,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:01:37,506 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:01:37,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:01:37 BoogieIcfgContainer [2022-11-03 02:01:37,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:01:37,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:01:37,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:01:37,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:01:37,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:01:36" (1/3) ... [2022-11-03 02:01:37,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b071500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:01:37, skipping insertion in model container [2022-11-03 02:01:37,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:01:36" (2/3) ... [2022-11-03 02:01:37,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b071500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:01:37, skipping insertion in model container [2022-11-03 02:01:37,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:01:37" (3/3) ... [2022-11-03 02:01:37,520 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2022-11-03 02:01:37,529 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:01:37,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:01:37,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:01:37,540 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:01:37,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:01:37,671 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:01:37,689 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 74 transitions, 153 flow [2022-11-03 02:01:37,694 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 153 flow [2022-11-03 02:01:37,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 153 flow [2022-11-03 02:01:37,758 INFO L130 PetriNetUnfolder]: 5/85 cut-off events. [2022-11-03 02:01:37,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:01:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 5/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-11-03 02:01:37,767 INFO L118 LiptonReduction]: Number of co-enabled transitions 1232 [2022-11-03 02:01:41,007 INFO L133 LiptonReduction]: Checked pairs total: 954 [2022-11-03 02:01:41,007 INFO L135 LiptonReduction]: Total number of compositions: 80 [2022-11-03 02:01:41,015 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 12 places, 10 transitions, 25 flow [2022-11-03 02:01:41,027 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 20 states have internal predecessors, (34), 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-11-03 02:01:41,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:01:41,050 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:01:41,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-03 02:01:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 20 states have internal predecessors, (34), 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-11-03 02:01:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:01:41,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:41,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:01:41,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:01:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 11762987, now seen corresponding path program 1 times [2022-11-03 02:01:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:41,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877466312] [2022-11-03 02:01:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:41,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-11-03 02:01:41,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:41,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877466312] [2022-11-03 02:01:41,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877466312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:41,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:41,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:01:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770836837] [2022-11-03 02:01:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:41,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:41,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:41,299 INFO L87 Difference]: Start difference. First operand has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 20 states have internal predecessors, (34), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:41,341 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2022-11-03 02:01:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:41,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:01:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:41,350 INFO L225 Difference]: With dead ends: 15 [2022-11-03 02:01:41,351 INFO L226 Difference]: Without dead ends: 15 [2022-11-03 02:01:41,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:41,356 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:41,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-03 02:01:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-03 02:01:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2022-11-03 02:01:41,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 4 [2022-11-03 02:01:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:41,391 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2022-11-03 02:01:41,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2022-11-03 02:01:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:01:41,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:41,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-03 02:01:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:01:41,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:01:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1580701328, now seen corresponding path program 1 times [2022-11-03 02:01:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:41,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506969313] [2022-11-03 02:01:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:41,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:01:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:41,486 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:01:41,486 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:01:41,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2022-11-03 02:01:41,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-11-03 02:01:41,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-11-03 02:01:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:01:41,493 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 02:01:41,495 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:01:41,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-03 02:01:41,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:01:41,525 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:01:41,526 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 119 transitions, 250 flow [2022-11-03 02:01:41,526 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 119 transitions, 250 flow [2022-11-03 02:01:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 250 flow [2022-11-03 02:01:41,560 INFO L130 PetriNetUnfolder]: 9/143 cut-off events. [2022-11-03 02:01:41,560 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:01:41,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 143 events. 9/143 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 224 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 6 conditions per place. [2022-11-03 02:01:41,568 INFO L118 LiptonReduction]: Number of co-enabled transitions 6424 [2022-11-03 02:01:45,065 INFO L133 LiptonReduction]: Checked pairs total: 6973 [2022-11-03 02:01:45,065 INFO L135 LiptonReduction]: Total number of compositions: 122 [2022-11-03 02:01:45,066 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 22 transitions, 56 flow [2022-11-03 02:01:45,092 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 229 states, 221 states have (on average 3.067873303167421) internal successors, (678), 228 states have internal predecessors, (678), 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-11-03 02:01:45,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:01:45,094 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:01:45,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 02:01:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 221 states have (on average 3.067873303167421) internal successors, (678), 228 states have internal predecessors, (678), 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-11-03 02:01:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:01:45,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:45,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:01:45,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-03 02:01:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 20522633, now seen corresponding path program 1 times [2022-11-03 02:01:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:45,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674300822] [2022-11-03 02:01:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:45,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:45,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674300822] [2022-11-03 02:01:45,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674300822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:45,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:45,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:01:45,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578821249] [2022-11-03 02:01:45,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:45,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:45,176 INFO L87 Difference]: Start difference. First operand has 229 states, 221 states have (on average 3.067873303167421) internal successors, (678), 228 states have internal predecessors, (678), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:45,230 INFO L93 Difference]: Finished difference Result 168 states and 439 transitions. [2022-11-03 02:01:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:45,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:01:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:45,236 INFO L225 Difference]: With dead ends: 168 [2022-11-03 02:01:45,236 INFO L226 Difference]: Without dead ends: 168 [2022-11-03 02:01:45,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:45,238 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:45,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-03 02:01:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-03 02:01:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 165 states have (on average 2.6606060606060606) internal successors, (439), 167 states have internal predecessors, (439), 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-11-03 02:01:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 439 transitions. [2022-11-03 02:01:45,274 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 439 transitions. Word has length 4 [2022-11-03 02:01:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:45,274 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 439 transitions. [2022-11-03 02:01:45,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 439 transitions. [2022-11-03 02:01:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:45,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:45,276 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:45,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:01:45,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-03 02:01:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash -112017095, now seen corresponding path program 1 times [2022-11-03 02:01:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:45,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517989652] [2022-11-03 02:01:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:45,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:45,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517989652] [2022-11-03 02:01:45,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517989652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:45,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:45,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:01:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493429326] [2022-11-03 02:01:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:45,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:45,491 INFO L87 Difference]: Start difference. First operand 168 states and 439 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-03 02:01:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:45,519 INFO L93 Difference]: Finished difference Result 148 states and 393 transitions. [2022-11-03 02:01:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2022-11-03 02:01:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:45,522 INFO L225 Difference]: With dead ends: 148 [2022-11-03 02:01:45,522 INFO L226 Difference]: Without dead ends: 148 [2022-11-03 02:01:45,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:45,523 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:45,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-03 02:01:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-03 02:01:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.673469387755102) internal successors, (393), 147 states have internal predecessors, (393), 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-11-03 02:01:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 393 transitions. [2022-11-03 02:01:45,542 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 393 transitions. Word has length 11 [2022-11-03 02:01:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:45,542 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 393 transitions. [2022-11-03 02:01:45,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-03 02:01:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 393 transitions. [2022-11-03 02:01:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:45,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:45,544 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-03 02:01:45,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:01:45,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-03 02:01:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1827920204, now seen corresponding path program 1 times [2022-11-03 02:01:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:45,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582403654] [2022-11-03 02:01:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:45,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:01:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:45,569 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:01:45,569 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:01:45,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-03 02:01:45,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-03 02:01:45,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-03 02:01:45,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-03 02:01:45,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:01:45,571 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:01:45,571 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:01:45,571 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-03 02:01:45,597 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:01:45,599 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:01:45,600 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 164 transitions, 349 flow [2022-11-03 02:01:45,600 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 164 transitions, 349 flow [2022-11-03 02:01:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 164 transitions, 349 flow [2022-11-03 02:01:45,639 INFO L130 PetriNetUnfolder]: 13/201 cut-off events. [2022-11-03 02:01:45,639 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-03 02:01:45,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 201 events. 13/201 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 461 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2022-11-03 02:01:45,649 INFO L118 LiptonReduction]: Number of co-enabled transitions 15576 [2022-11-03 02:01:50,171 INFO L133 LiptonReduction]: Checked pairs total: 17627 [2022-11-03 02:01:50,171 INFO L135 LiptonReduction]: Total number of compositions: 168 [2022-11-03 02:01:50,172 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions, 81 flow [2022-11-03 02:01:50,245 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1425 states, 1406 states have (on average 4.166429587482219) internal successors, (5858), 1424 states have internal predecessors, (5858), 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-11-03 02:01:50,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:01:50,250 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:01:50,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 02:01:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 1425 states, 1406 states have (on average 4.166429587482219) internal successors, (5858), 1424 states have internal predecessors, (5858), 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-11-03 02:01:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:01:50,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:50,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:01:50,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-03 02:01:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 32070986, now seen corresponding path program 1 times [2022-11-03 02:01:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865170999] [2022-11-03 02:01:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:50,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:50,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865170999] [2022-11-03 02:01:50,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865170999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:50,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:50,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:01:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637663330] [2022-11-03 02:01:50,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:50,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:50,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:50,294 INFO L87 Difference]: Start difference. First operand has 1425 states, 1406 states have (on average 4.166429587482219) internal successors, (5858), 1424 states have internal predecessors, (5858), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:50,373 INFO L93 Difference]: Finished difference Result 1034 states and 3679 transitions. [2022-11-03 02:01:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:01:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:50,386 INFO L225 Difference]: With dead ends: 1034 [2022-11-03 02:01:50,386 INFO L226 Difference]: Without dead ends: 1034 [2022-11-03 02:01:50,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:50,388 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-03 02:01:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-11-03 02:01:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1027 states have (on average 3.5822784810126582) internal successors, (3679), 1033 states have internal predecessors, (3679), 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-11-03 02:01:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3679 transitions. [2022-11-03 02:01:50,458 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 3679 transitions. Word has length 4 [2022-11-03 02:01:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:50,458 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 3679 transitions. [2022-11-03 02:01:50,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 3679 transitions. [2022-11-03 02:01:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:50,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:50,460 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:50,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:01:50,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-03 02:01:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash -925504723, now seen corresponding path program 1 times [2022-11-03 02:01:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:50,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407937037] [2022-11-03 02:01:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:01:50,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:50,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407937037] [2022-11-03 02:01:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407937037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:01:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414286593] [2022-11-03 02:01:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:50,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:50,540 INFO L87 Difference]: Start difference. First operand 1034 states and 3679 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 02:01:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:50,578 INFO L93 Difference]: Finished difference Result 748 states and 2718 transitions. [2022-11-03 02:01:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 11 [2022-11-03 02:01:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:50,584 INFO L225 Difference]: With dead ends: 748 [2022-11-03 02:01:50,585 INFO L226 Difference]: Without dead ends: 748 [2022-11-03 02:01:50,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:50,586 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:50,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-03 02:01:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2022-11-03 02:01:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.63855421686747) internal successors, (2718), 747 states have internal predecessors, (2718), 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-11-03 02:01:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2718 transitions. [2022-11-03 02:01:50,618 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2718 transitions. Word has length 11 [2022-11-03 02:01:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:50,619 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 2718 transitions. [2022-11-03 02:01:50,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 02:01:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2718 transitions. [2022-11-03 02:01:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:01:50,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:50,621 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-03 02:01:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:01:50,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-03 02:01:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1977807196, now seen corresponding path program 1 times [2022-11-03 02:01:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:50,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624141343] [2022-11-03 02:01:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:50,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:01:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:50,680 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:01:50,680 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:01:50,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-03 02:01:50,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-03 02:01:50,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-03 02:01:50,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-03 02:01:50,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-03 02:01:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:01:50,682 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:01:50,683 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:01:50,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-03 02:01:50,718 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:01:50,732 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:01:50,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 209 transitions, 450 flow [2022-11-03 02:01:50,733 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 209 transitions, 450 flow [2022-11-03 02:01:50,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 209 transitions, 450 flow [2022-11-03 02:01:50,797 INFO L130 PetriNetUnfolder]: 17/259 cut-off events. [2022-11-03 02:01:50,797 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-03 02:01:50,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 259 events. 17/259 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 727 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 209. Up to 10 conditions per place. [2022-11-03 02:01:50,817 INFO L118 LiptonReduction]: Number of co-enabled transitions 28688 [2022-11-03 02:01:56,433 INFO L133 LiptonReduction]: Checked pairs total: 33255 [2022-11-03 02:01:56,433 INFO L135 LiptonReduction]: Total number of compositions: 227 [2022-11-03 02:01:56,434 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 35 transitions, 102 flow [2022-11-03 02:01:56,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8729 states, 8687 states have (on average 4.837573385518591) internal successors, (42024), 8728 states have internal predecessors, (42024), 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-11-03 02:01:56,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:01:56,868 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:01:56,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 02:01:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 8729 states, 8687 states have (on average 4.837573385518591) internal successors, (42024), 8728 states have internal predecessors, (42024), 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-11-03 02:01:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:01:56,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:56,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:01:56,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-03 02:01:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 46533144, now seen corresponding path program 1 times [2022-11-03 02:01:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721709338] [2022-11-03 02:01:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:56,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:56,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721709338] [2022-11-03 02:01:56,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721709338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:56,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:56,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:01:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878198176] [2022-11-03 02:01:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:56,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:56,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:56,958 INFO L87 Difference]: Start difference. First operand has 8729 states, 8687 states have (on average 4.837573385518591) internal successors, (42024), 8728 states have internal predecessors, (42024), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:57,235 INFO L93 Difference]: Finished difference Result 6460 states and 29327 transitions. [2022-11-03 02:01:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:57,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:01:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:57,313 INFO L225 Difference]: With dead ends: 6460 [2022-11-03 02:01:57,313 INFO L226 Difference]: Without dead ends: 6460 [2022-11-03 02:01:57,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:57,314 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:57,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:01:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-11-03 02:01:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2022-11-03 02:01:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6460 states, 6445 states have (on average 4.550349107835531) internal successors, (29327), 6459 states have internal predecessors, (29327), 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-11-03 02:01:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 29327 transitions. [2022-11-03 02:01:57,762 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 29327 transitions. Word has length 4 [2022-11-03 02:01:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:57,770 INFO L495 AbstractCegarLoop]: Abstraction has 6460 states and 29327 transitions. [2022-11-03 02:01:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:01:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 29327 transitions. [2022-11-03 02:01:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:57,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:57,772 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:57,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:01:57,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-03 02:01:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -990530169, now seen corresponding path program 1 times [2022-11-03 02:01:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:57,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455433672] [2022-11-03 02:01:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:01:57,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455433672] [2022-11-03 02:01:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455433672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:57,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:01:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738234030] [2022-11-03 02:01:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:57,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:57,844 INFO L87 Difference]: Start difference. First operand 6460 states and 29327 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 02:01:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:57,947 INFO L93 Difference]: Finished difference Result 3748 states and 17343 transitions. [2022-11-03 02:01:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 11 [2022-11-03 02:01:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:57,984 INFO L225 Difference]: With dead ends: 3748 [2022-11-03 02:01:57,984 INFO L226 Difference]: Without dead ends: 3748 [2022-11-03 02:01:57,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:57,985 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:57,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:01:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-11-03 02:01:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3748. [2022-11-03 02:01:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3748 states, 3747 states have (on average 4.628502802241793) internal successors, (17343), 3747 states have internal predecessors, (17343), 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-11-03 02:01:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 17343 transitions. [2022-11-03 02:01:58,263 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 17343 transitions. Word has length 11 [2022-11-03 02:01:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:58,263 INFO L495 AbstractCegarLoop]: Abstraction has 3748 states and 17343 transitions. [2022-11-03 02:01:58,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 02:01:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 17343 transitions. [2022-11-03 02:01:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:01:58,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:58,266 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:58,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:01:58,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-03 02:01:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1786662935, now seen corresponding path program 1 times [2022-11-03 02:01:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:58,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865524795] [2022-11-03 02:01:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:58,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:01:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:01:58,316 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:01:58,319 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:01:58,319 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-03 02:01:58,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-03 02:01:58,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-03 02:01:58,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-03 02:01:58,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-03 02:01:58,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-03 02:01:58,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:01:58,329 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:01:58,330 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:01:58,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-03 02:01:58,367 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:01:58,370 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:01:58,370 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 254 transitions, 553 flow [2022-11-03 02:01:58,370 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 254 transitions, 553 flow [2022-11-03 02:01:58,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 254 transitions, 553 flow [2022-11-03 02:01:58,520 INFO L130 PetriNetUnfolder]: 21/317 cut-off events. [2022-11-03 02:01:58,520 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-03 02:01:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 317 events. 21/317 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 987 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 272. Up to 12 conditions per place. [2022-11-03 02:01:58,543 INFO L118 LiptonReduction]: Number of co-enabled transitions 45760 [2022-11-03 02:02:05,358 INFO L133 LiptonReduction]: Checked pairs total: 51785 [2022-11-03 02:02:05,358 INFO L135 LiptonReduction]: Total number of compositions: 272 [2022-11-03 02:02:05,359 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 43 transitions, 131 flow [2022-11-03 02:02:07,312 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 53065 states, 52976 states have (on average 5.994790093627303) internal successors, (317580), 53064 states have internal predecessors, (317580), 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-11-03 02:02:07,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:02:07,314 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:02:07,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 02:02:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 53065 states, 52976 states have (on average 5.994790093627303) internal successors, (317580), 53064 states have internal predecessors, (317580), 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-11-03 02:02:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:02:07,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:07,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:02:07,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-03 02:02:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash 64572595, now seen corresponding path program 1 times [2022-11-03 02:02:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:07,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078866085] [2022-11-03 02:02:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:07,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:07,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078866085] [2022-11-03 02:02:07,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078866085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:07,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:07,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:02:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970182163] [2022-11-03 02:02:07,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:02:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:02:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:07,759 INFO L87 Difference]: Start difference. First operand has 53065 states, 52976 states have (on average 5.994790093627303) internal successors, (317580), 53064 states have internal predecessors, (317580), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:02:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:09,152 INFO L93 Difference]: Finished difference Result 40314 states and 223471 transitions. [2022-11-03 02:02:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:02:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:02:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:09,751 INFO L225 Difference]: With dead ends: 40314 [2022-11-03 02:02:09,752 INFO L226 Difference]: Without dead ends: 40314 [2022-11-03 02:02:09,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:09,753 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:09,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:02:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40314 states. [2022-11-03 02:02:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40314 to 40314. [2022-11-03 02:02:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40314 states, 40283 states have (on average 5.547526251768736) internal successors, (223471), 40313 states have internal predecessors, (223471), 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-11-03 02:02:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40314 states to 40314 states and 223471 transitions. [2022-11-03 02:02:12,265 INFO L78 Accepts]: Start accepts. Automaton has 40314 states and 223471 transitions. Word has length 4 [2022-11-03 02:02:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:12,266 INFO L495 AbstractCegarLoop]: Abstraction has 40314 states and 223471 transitions. [2022-11-03 02:02:12,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:02:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 40314 states and 223471 transitions. [2022-11-03 02:02:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:02:12,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:12,267 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:12,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:02:12,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-03 02:02:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1082569337, now seen corresponding path program 1 times [2022-11-03 02:02:12,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:12,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637650720] [2022-11-03 02:02:12,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:12,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:12,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637650720] [2022-11-03 02:02:12,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637650720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:12,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:12,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:02:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499789918] [2022-11-03 02:02:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:12,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:02:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:02:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:12,339 INFO L87 Difference]: Start difference. First operand 40314 states and 223471 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-03 02:02:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:12,680 INFO L93 Difference]: Finished difference Result 18748 states and 105468 transitions. [2022-11-03 02:02:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:02:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2022-11-03 02:02:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:13,202 INFO L225 Difference]: With dead ends: 18748 [2022-11-03 02:02:13,202 INFO L226 Difference]: Without dead ends: 18748 [2022-11-03 02:02:13,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:13,204 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:13,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:02:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18748 states. [2022-11-03 02:02:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18748 to 18748. [2022-11-03 02:02:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18748 states, 18747 states have (on average 5.62586013762202) internal successors, (105468), 18747 states have internal predecessors, (105468), 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-11-03 02:02:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18748 states to 18748 states and 105468 transitions. [2022-11-03 02:02:14,071 INFO L78 Accepts]: Start accepts. Automaton has 18748 states and 105468 transitions. Word has length 11 [2022-11-03 02:02:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:14,072 INFO L495 AbstractCegarLoop]: Abstraction has 18748 states and 105468 transitions. [2022-11-03 02:02:14,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-03 02:02:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 18748 states and 105468 transitions. [2022-11-03 02:02:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:02:14,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:14,080 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:14,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:02:14,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-03 02:02:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash 740084152, now seen corresponding path program 1 times [2022-11-03 02:02:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:14,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613420440] [2022-11-03 02:02:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:02:14,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:02:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:02:14,108 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:02:14,108 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:02:14,108 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-03 02:02:14,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 02:02:14,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-11-03 02:02:14,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-03 02:02:14,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-03 02:02:14,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-03 02:02:14,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 02:02:14,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:02:14,110 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:02:14,110 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:02:14,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-03 02:02:14,142 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:02:14,145 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:02:14,145 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 299 transitions, 658 flow [2022-11-03 02:02:14,146 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 299 transitions, 658 flow [2022-11-03 02:02:14,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 299 transitions, 658 flow [2022-11-03 02:02:14,227 INFO L130 PetriNetUnfolder]: 25/375 cut-off events. [2022-11-03 02:02:14,228 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-03 02:02:14,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 375 events. 25/375 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1267 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 336. Up to 14 conditions per place. [2022-11-03 02:02:14,260 INFO L118 LiptonReduction]: Number of co-enabled transitions 66792 [2022-11-03 02:02:22,846 INFO L133 LiptonReduction]: Checked pairs total: 77196 [2022-11-03 02:02:22,847 INFO L135 LiptonReduction]: Total number of compositions: 318 [2022-11-03 02:02:22,847 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 52 transitions, 164 flow [2022-11-03 02:02:38,597 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 321129 states, 320945 states have (on average 7.300222779603982) internal successors, (2342970), 321128 states have internal predecessors, (2342970), 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-11-03 02:02:38,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:02:38,602 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@71276d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:02:38,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-03 02:02:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 321129 states, 320945 states have (on average 7.300222779603982) internal successors, (2342970), 321128 states have internal predecessors, (2342970), 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-11-03 02:02:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:02:39,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:39,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:02:39,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:02:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 84526341, now seen corresponding path program 1 times [2022-11-03 02:02:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468511763] [2022-11-03 02:02:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:39,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:39,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468511763] [2022-11-03 02:02:39,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468511763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:39,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:39,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:02:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691019754] [2022-11-03 02:02:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:39,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:02:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:39,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:02:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:39,674 INFO L87 Difference]: Start difference. First operand has 321129 states, 320945 states have (on average 7.300222779603982) internal successors, (2342970), 321128 states have internal predecessors, (2342970), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 02:02:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:46,575 INFO L93 Difference]: Finished difference Result 249764 states and 1637767 transitions. [2022-11-03 02:02:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:02:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-03 02:02:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:49,948 INFO L225 Difference]: With dead ends: 249764 [2022-11-03 02:02:49,948 INFO L226 Difference]: Without dead ends: 249764 [2022-11-03 02:02:49,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:02:49,949 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:49,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:02:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249764 states.